{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:2S47YFIG6D6QW6CNGCSBEMMA3B","short_pith_number":"pith:2S47YFIG","canonical_record":{"source":{"id":"1505.00147","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-05-01T10:40:07Z","cross_cats_sorted":[],"title_canon_sha256":"2dc703aa2dd3885dcd2fe0f6ca9eec42a9df0766e4c18b7a1e2b74f760aaa92f","abstract_canon_sha256":"f85b6ed60217184df9059211d193aeaabe8bf1bde124cb4581f9ffca2e868928"},"schema_version":"1.0"},"canonical_sha256":"d4b9fc1506f0fd0b784d30a4123180d849b0ca28713c1ef45d5ec246680f91b6","source":{"kind":"arxiv","id":"1505.00147","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.00147","created_at":"2026-05-18T02:17:13Z"},{"alias_kind":"arxiv_version","alias_value":"1505.00147v1","created_at":"2026-05-18T02:17:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.00147","created_at":"2026-05-18T02:17:13Z"},{"alias_kind":"pith_short_12","alias_value":"2S47YFIG6D6Q","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"2S47YFIG6D6QW6CN","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"2S47YFIG","created_at":"2026-05-18T12:29:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:2S47YFIG6D6QW6CNGCSBEMMA3B","target":"record","payload":{"canonical_record":{"source":{"id":"1505.00147","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-05-01T10:40:07Z","cross_cats_sorted":[],"title_canon_sha256":"2dc703aa2dd3885dcd2fe0f6ca9eec42a9df0766e4c18b7a1e2b74f760aaa92f","abstract_canon_sha256":"f85b6ed60217184df9059211d193aeaabe8bf1bde124cb4581f9ffca2e868928"},"schema_version":"1.0"},"canonical_sha256":"d4b9fc1506f0fd0b784d30a4123180d849b0ca28713c1ef45d5ec246680f91b6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:17:13.377533Z","signature_b64":"MnODPZBhN6rccBzVU4aSiHaXQTUYJLpE0w7mBRnjIBUO/GZVqDNFft3/QQfvDUxV/npwDsbnNNDIGtgxKj2RDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d4b9fc1506f0fd0b784d30a4123180d849b0ca28713c1ef45d5ec246680f91b6","last_reissued_at":"2026-05-18T02:17:13.376802Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:17:13.376802Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1505.00147","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-18T02:17:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t0VME/ECxOhDm2lz99m3m71BdAuNrVJPVHl5a69oVGh2StSrJnVMgXA6MUmUiBKlUgc1uvuRmAgARHycxIw+AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T00:06:35.894071Z"},"content_sha256":"bf071c61bc3fa6108bec01e7838bde5af73b46164042d6dd8701f528105a03db","schema_version":"1.0","event_id":"sha256:bf071c61bc3fa6108bec01e7838bde5af73b46164042d6dd8701f528105a03db"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:2S47YFIG6D6QW6CNGCSBEMMA3B","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Strictly Implicit Priority Queues: On the Number of Moves and Worst-Case Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Gerth St{\\o}lting Brodal, Jakob Truelsen, Jesper Sindahl Nielsen","submitted_at":"2015-05-01T10:40:07Z","abstract_excerpt":"The binary heap of Williams (1964) is a simple priority queue characterized by only storing an array containing the elements and the number of elements $n$ - here denoted a strictly implicit priority queue. We introduce two new strictly implicit priority queues. The first structure supports amortized $O(1)$ time Insert and $O(\\log n)$ time ExtractMin operations, where both operations require amortized $O(1)$ element moves. No previous implicit heap with $O(1)$ time Insert supports both operations with $O(1)$ moves. The second structure supports worst-case $O(1)$ time Insert and $O(\\log n)$ tim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.00147","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-18T02:17:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k+2UA/kGGDwh3lJI6WB/I9t8j3uLPQOK+D4scH9MeljC4UJi+k8HAS9i6cZUHWfm82FQjWt1gFcZagPhSRSZDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T00:06:35.894810Z"},"content_sha256":"f224b7bfdd7ec1ee3f92f63746fbc180c5488c5d86a112f381c0c8d825b7dfdd","schema_version":"1.0","event_id":"sha256:f224b7bfdd7ec1ee3f92f63746fbc180c5488c5d86a112f381c0c8d825b7dfdd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2S47YFIG6D6QW6CNGCSBEMMA3B/bundle.json","state_url":"https://pith.science/pith/2S47YFIG6D6QW6CNGCSBEMMA3B/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2S47YFIG6D6QW6CNGCSBEMMA3B/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-10T00:06:35Z","links":{"resolver":"https://pith.science/pith/2S47YFIG6D6QW6CNGCSBEMMA3B","bundle":"https://pith.science/pith/2S47YFIG6D6QW6CNGCSBEMMA3B/bundle.json","state":"https://pith.science/pith/2S47YFIG6D6QW6CNGCSBEMMA3B/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2S47YFIG6D6QW6CNGCSBEMMA3B/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:2S47YFIG6D6QW6CNGCSBEMMA3B","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":"f85b6ed60217184df9059211d193aeaabe8bf1bde124cb4581f9ffca2e868928","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-05-01T10:40:07Z","title_canon_sha256":"2dc703aa2dd3885dcd2fe0f6ca9eec42a9df0766e4c18b7a1e2b74f760aaa92f"},"schema_version":"1.0","source":{"id":"1505.00147","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.00147","created_at":"2026-05-18T02:17:13Z"},{"alias_kind":"arxiv_version","alias_value":"1505.00147v1","created_at":"2026-05-18T02:17:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.00147","created_at":"2026-05-18T02:17:13Z"},{"alias_kind":"pith_short_12","alias_value":"2S47YFIG6D6Q","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"2S47YFIG6D6QW6CN","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"2S47YFIG","created_at":"2026-05-18T12:29:02Z"}],"graph_snapshots":[{"event_id":"sha256:f224b7bfdd7ec1ee3f92f63746fbc180c5488c5d86a112f381c0c8d825b7dfdd","target":"graph","created_at":"2026-05-18T02:17:13Z","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":"The binary heap of Williams (1964) is a simple priority queue characterized by only storing an array containing the elements and the number of elements $n$ - here denoted a strictly implicit priority queue. We introduce two new strictly implicit priority queues. The first structure supports amortized $O(1)$ time Insert and $O(\\log n)$ time ExtractMin operations, where both operations require amortized $O(1)$ element moves. No previous implicit heap with $O(1)$ time Insert supports both operations with $O(1)$ moves. The second structure supports worst-case $O(1)$ time Insert and $O(\\log n)$ tim","authors_text":"Gerth St{\\o}lting Brodal, Jakob Truelsen, Jesper Sindahl Nielsen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-05-01T10:40:07Z","title":"Strictly Implicit Priority Queues: On the Number of Moves and Worst-Case Time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.00147","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:bf071c61bc3fa6108bec01e7838bde5af73b46164042d6dd8701f528105a03db","target":"record","created_at":"2026-05-18T02:17:13Z","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":"f85b6ed60217184df9059211d193aeaabe8bf1bde124cb4581f9ffca2e868928","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-05-01T10:40:07Z","title_canon_sha256":"2dc703aa2dd3885dcd2fe0f6ca9eec42a9df0766e4c18b7a1e2b74f760aaa92f"},"schema_version":"1.0","source":{"id":"1505.00147","kind":"arxiv","version":1}},"canonical_sha256":"d4b9fc1506f0fd0b784d30a4123180d849b0ca28713c1ef45d5ec246680f91b6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d4b9fc1506f0fd0b784d30a4123180d849b0ca28713c1ef45d5ec246680f91b6","first_computed_at":"2026-05-18T02:17:13.376802Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:17:13.376802Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MnODPZBhN6rccBzVU4aSiHaXQTUYJLpE0w7mBRnjIBUO/GZVqDNFft3/QQfvDUxV/npwDsbnNNDIGtgxKj2RDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:17:13.377533Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.00147","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bf071c61bc3fa6108bec01e7838bde5af73b46164042d6dd8701f528105a03db","sha256:f224b7bfdd7ec1ee3f92f63746fbc180c5488c5d86a112f381c0c8d825b7dfdd"],"state_sha256":"207675b7e0810206713e45a7366793c14cbdd067c50ca1f6d057529d47582ede"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mwYh0+i/ZQqDEaaf4Bzeu47xg59c8J4yoYdziHSc7LGKX9dDlhr+GHTNjRmggQFMHc5Ppvalp1LlxkiyqxhgAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T00:06:35.898797Z","bundle_sha256":"2582c43845e35838e2b1915071d64e839e47a9284690b3fbda61812992206fc5"}}