{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:SVGNIKBKDNV5BAROY36BENFHM2","short_pith_number":"pith:SVGNIKBK","schema_version":"1.0","canonical_sha256":"954cd4282a1b6bd0822ec6fc1234a766a519874a672502169f2051a15711fddd","source":{"kind":"arxiv","id":"1209.4971","version":1},"attestation_state":"computed","paper":{"title":"Streaming Complexity of Checking Priority Queues","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Frederic Magniez, Nathana\\\"el Fran\\c{c}ois","submitted_at":"2012-09-22T08:37:17Z","abstract_excerpt":"This work is in the line of designing efficient checkers for testing the reliability of some massive data structures. Given a sequential access to the insert/extract operations on such a structure, one would like to decide, a posteriori only, if it corresponds to the evolution of a reliable structure. In a context of massive data, one would like to minimize both the amount of reliable memory of the checker and the number of passes on the sequence of operations. Chu, Kannan and McGregor initiated the study of checking priority queues in this setting. They showed that use of timestamps allows to"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1209.4971","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-09-22T08:37:17Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"512be32aefaf544a2e78c8f24d6f739b8d64d17bb19367284d662452eaaa5d81","abstract_canon_sha256":"c647c2845207a0d5407be8a5b8f003775aee0a4d47509e4140731b6b3c16a37c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:44:59.564146Z","signature_b64":"iEqZdBOP4YRNwEMoqhw+CNGc/4pXcBgWWsMhpAsVxfrhszAX/XKiWYHWStjKGMQ0Mqz9B7nZ1dmDDWvV3oe2Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"954cd4282a1b6bd0822ec6fc1234a766a519874a672502169f2051a15711fddd","last_reissued_at":"2026-05-18T03:44:59.563371Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:44:59.563371Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Streaming Complexity of Checking Priority Queues","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Frederic Magniez, Nathana\\\"el Fran\\c{c}ois","submitted_at":"2012-09-22T08:37:17Z","abstract_excerpt":"This work is in the line of designing efficient checkers for testing the reliability of some massive data structures. Given a sequential access to the insert/extract operations on such a structure, one would like to decide, a posteriori only, if it corresponds to the evolution of a reliable structure. In a context of massive data, one would like to minimize both the amount of reliable memory of the checker and the number of passes on the sequence of operations. Chu, Kannan and McGregor initiated the study of checking priority queues in this setting. They showed that use of timestamps allows to"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.4971","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1209.4971","created_at":"2026-05-18T03:44:59.563482+00:00"},{"alias_kind":"arxiv_version","alias_value":"1209.4971v1","created_at":"2026-05-18T03:44:59.563482+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.4971","created_at":"2026-05-18T03:44:59.563482+00:00"},{"alias_kind":"pith_short_12","alias_value":"SVGNIKBKDNV5","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_16","alias_value":"SVGNIKBKDNV5BARO","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_8","alias_value":"SVGNIKBK","created_at":"2026-05-18T12:27:23.164592+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SVGNIKBKDNV5BAROY36BENFHM2","json":"https://pith.science/pith/SVGNIKBKDNV5BAROY36BENFHM2.json","graph_json":"https://pith.science/api/pith-number/SVGNIKBKDNV5BAROY36BENFHM2/graph.json","events_json":"https://pith.science/api/pith-number/SVGNIKBKDNV5BAROY36BENFHM2/events.json","paper":"https://pith.science/paper/SVGNIKBK"},"agent_actions":{"view_html":"https://pith.science/pith/SVGNIKBKDNV5BAROY36BENFHM2","download_json":"https://pith.science/pith/SVGNIKBKDNV5BAROY36BENFHM2.json","view_paper":"https://pith.science/paper/SVGNIKBK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1209.4971&json=true","fetch_graph":"https://pith.science/api/pith-number/SVGNIKBKDNV5BAROY36BENFHM2/graph.json","fetch_events":"https://pith.science/api/pith-number/SVGNIKBKDNV5BAROY36BENFHM2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SVGNIKBKDNV5BAROY36BENFHM2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SVGNIKBKDNV5BAROY36BENFHM2/action/storage_attestation","attest_author":"https://pith.science/pith/SVGNIKBKDNV5BAROY36BENFHM2/action/author_attestation","sign_citation":"https://pith.science/pith/SVGNIKBKDNV5BAROY36BENFHM2/action/citation_signature","submit_replication":"https://pith.science/pith/SVGNIKBKDNV5BAROY36BENFHM2/action/replication_record"}},"created_at":"2026-05-18T03:44:59.563482+00:00","updated_at":"2026-05-18T03:44:59.563482+00:00"}