{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:SVGNIKBKDNV5BAROY36BENFHM2","short_pith_number":"pith:SVGNIKBK","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"},"canonical_sha256":"954cd4282a1b6bd0822ec6fc1234a766a519874a672502169f2051a15711fddd","source":{"kind":"arxiv","id":"1209.4971","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.4971","created_at":"2026-05-18T03:44:59Z"},{"alias_kind":"arxiv_version","alias_value":"1209.4971v1","created_at":"2026-05-18T03:44:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.4971","created_at":"2026-05-18T03:44:59Z"},{"alias_kind":"pith_short_12","alias_value":"SVGNIKBKDNV5","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_16","alias_value":"SVGNIKBKDNV5BARO","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_8","alias_value":"SVGNIKBK","created_at":"2026-05-18T12:27:23Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:SVGNIKBKDNV5BAROY36BENFHM2","target":"record","payload":{"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"},"canonical_sha256":"954cd4282a1b6bd0822ec6fc1234a766a519874a672502169f2051a15711fddd","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"},"source_kind":"arxiv","source_id":"1209.4971","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:44:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SOg35WKgy+3sLjVUyYF4rA4kBuBl5ocoUQPMRHck5rQ3mOA9SZspyPS8Ef7gthCZZOEjMDN+FPlXJ6loTGt+BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T01:52:55.661880Z"},"content_sha256":"b5db9317b22fa052174178afb3264e876e539734eae6e8568fde24a39e0f054e","schema_version":"1.0","event_id":"sha256:b5db9317b22fa052174178afb3264e876e539734eae6e8568fde24a39e0f054e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:SVGNIKBKDNV5BAROY36BENFHM2","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:44:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bzWdoYixQ4OHbOvuLOf62MabvYBoDhpDMCJpIwTIU/ujWWOQMX/g/3Niamnam//gI9JitypkbhhOmFw42ZmABw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T01:52:55.662233Z"},"content_sha256":"760a8ffcb80a37a46d7c948f8cf86e86d53715337a5e1b62db9ad94d64483c69","schema_version":"1.0","event_id":"sha256:760a8ffcb80a37a46d7c948f8cf86e86d53715337a5e1b62db9ad94d64483c69"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SVGNIKBKDNV5BAROY36BENFHM2/bundle.json","state_url":"https://pith.science/pith/SVGNIKBKDNV5BAROY36BENFHM2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SVGNIKBKDNV5BAROY36BENFHM2/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-26T01:52:55Z","links":{"resolver":"https://pith.science/pith/SVGNIKBKDNV5BAROY36BENFHM2","bundle":"https://pith.science/pith/SVGNIKBKDNV5BAROY36BENFHM2/bundle.json","state":"https://pith.science/pith/SVGNIKBKDNV5BAROY36BENFHM2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SVGNIKBKDNV5BAROY36BENFHM2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:SVGNIKBKDNV5BAROY36BENFHM2","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"c647c2845207a0d5407be8a5b8f003775aee0a4d47509e4140731b6b3c16a37c","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-09-22T08:37:17Z","title_canon_sha256":"512be32aefaf544a2e78c8f24d6f739b8d64d17bb19367284d662452eaaa5d81"},"schema_version":"1.0","source":{"id":"1209.4971","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.4971","created_at":"2026-05-18T03:44:59Z"},{"alias_kind":"arxiv_version","alias_value":"1209.4971v1","created_at":"2026-05-18T03:44:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.4971","created_at":"2026-05-18T03:44:59Z"},{"alias_kind":"pith_short_12","alias_value":"SVGNIKBKDNV5","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_16","alias_value":"SVGNIKBKDNV5BARO","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_8","alias_value":"SVGNIKBK","created_at":"2026-05-18T12:27:23Z"}],"graph_snapshots":[{"event_id":"sha256:760a8ffcb80a37a46d7c948f8cf86e86d53715337a5e1b62db9ad94d64483c69","target":"graph","created_at":"2026-05-18T03:44:59Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Frederic Magniez, Nathana\\\"el Fran\\c{c}ois","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-09-22T08:37:17Z","title":"Streaming Complexity of Checking Priority Queues"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.4971","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:b5db9317b22fa052174178afb3264e876e539734eae6e8568fde24a39e0f054e","target":"record","created_at":"2026-05-18T03:44:59Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"c647c2845207a0d5407be8a5b8f003775aee0a4d47509e4140731b6b3c16a37c","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-09-22T08:37:17Z","title_canon_sha256":"512be32aefaf544a2e78c8f24d6f739b8d64d17bb19367284d662452eaaa5d81"},"schema_version":"1.0","source":{"id":"1209.4971","kind":"arxiv","version":1}},"canonical_sha256":"954cd4282a1b6bd0822ec6fc1234a766a519874a672502169f2051a15711fddd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"954cd4282a1b6bd0822ec6fc1234a766a519874a672502169f2051a15711fddd","first_computed_at":"2026-05-18T03:44:59.563371Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:44:59.563371Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iEqZdBOP4YRNwEMoqhw+CNGc/4pXcBgWWsMhpAsVxfrhszAX/XKiWYHWStjKGMQ0Mqz9B7nZ1dmDDWvV3oe2Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:44:59.564146Z","signed_message":"canonical_sha256_bytes"},"source_id":"1209.4971","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b5db9317b22fa052174178afb3264e876e539734eae6e8568fde24a39e0f054e","sha256:760a8ffcb80a37a46d7c948f8cf86e86d53715337a5e1b62db9ad94d64483c69"],"state_sha256":"7f84fcaf4d4fa09fc86e6d1102d5497251d2daa19e3f48d2de2274bd8ff77fda"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lWDv84yGRm6DC1LADyzWITStlYxcgg8zCQxxKsK6CuG9AJ3dRixUImbzP6TpkNb5JFMEImh1dKkP3rXoSvZLDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T01:52:55.664381Z","bundle_sha256":"06da4dfd34a2ce081936a27075b79ab2cad6c9c31e4b25be17e349825b65976c"}}