{"as_of":"2026-07-17T04:26:00Z","canonical_paper_id":"6LJNDROO","canonical_url":"https://pith.science/paper/6LJNDROO/integrity","context_digest":"sha256:0ea9cc185be184276a267ff289ac7377719169d86b601d7362b6ddde58e813da","coverage_summary":[],"findings":[],"findings_empty_copy":"No checks are listed for this paper yet.","findings_observation_state":"no_listed_checks","links":{"arxiv":"https://arxiv.org/abs/1910.14003","bundle_json":"/pith/6LJNDROOT6O2I5BSGW4LWMET7E/bundle.json","citation_record":"/paper/6LJNDROO/citation-record","evidence":"/evidence","html":"/paper/6LJNDROO/integrity","integrity_json":"/paper/6LJNDROO/integrity.json","json":"/paper/6LJNDROO/integrity.json","legacy_integrity_json":"/pith/6LJNDROO/integrity.json","paper":"/paper/6LJNDROO","reference_changes":"/flags?citing=6LJNDROO"},"paper":{"arxiv_id":"1910.14003","latest_version":2,"primary_cat":"cs.IT","title":"Recursive Optimization of Finite Blocklength Allocation to Mitigate Age-of-Information Outage"},"pith_number":"pith:2019:6LJNDROOT6O2I5BSGW4LWMET7E","pith_short":"6LJNDROOT6O2I5BSGW4LWMET7E","record":{"arxiv_id":"1910.14003","claim":"As of an unrecorded date, Pith completed 0 of 0 listed checks against arXiv:1910.14003. No listed check completed, so this record makes no findings claim.","counts":{"completed":0,"failed":0,"listed":0,"not_collected":0,"not_requested":0,"partial":0,"public_findings_from_completed":0,"skipped":0,"unavailable":0,"withheld":0},"coverage":[],"observed_at":null,"refusal":"This is a record of named checks, not a clean-status claim or a paper verdict.","schema":"pith.integrity.v1"},"schema":"pith.paper-integrity-record.v1","species":"LEDGER"}