{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:2S47YFIG6D6QW6CNGCSBEMMA3B","short_pith_number":"pith:2S47YFIG","schema_version":"1.0","canonical_sha256":"d4b9fc1506f0fd0b784d30a4123180d849b0ca28713c1ef45d5ec246680f91b6","source":{"kind":"arxiv","id":"1505.00147","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1505.00147","created_at":"2026-05-18T02:17:13.376923+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.00147v1","created_at":"2026-05-18T02:17:13.376923+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.00147","created_at":"2026-05-18T02:17:13.376923+00:00"},{"alias_kind":"pith_short_12","alias_value":"2S47YFIG6D6Q","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_16","alias_value":"2S47YFIG6D6QW6CN","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_8","alias_value":"2S47YFIG","created_at":"2026-05-18T12:29:02.477457+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/2S47YFIG6D6QW6CNGCSBEMMA3B","json":"https://pith.science/pith/2S47YFIG6D6QW6CNGCSBEMMA3B.json","graph_json":"https://pith.science/api/pith-number/2S47YFIG6D6QW6CNGCSBEMMA3B/graph.json","events_json":"https://pith.science/api/pith-number/2S47YFIG6D6QW6CNGCSBEMMA3B/events.json","paper":"https://pith.science/paper/2S47YFIG"},"agent_actions":{"view_html":"https://pith.science/pith/2S47YFIG6D6QW6CNGCSBEMMA3B","download_json":"https://pith.science/pith/2S47YFIG6D6QW6CNGCSBEMMA3B.json","view_paper":"https://pith.science/paper/2S47YFIG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.00147&json=true","fetch_graph":"https://pith.science/api/pith-number/2S47YFIG6D6QW6CNGCSBEMMA3B/graph.json","fetch_events":"https://pith.science/api/pith-number/2S47YFIG6D6QW6CNGCSBEMMA3B/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2S47YFIG6D6QW6CNGCSBEMMA3B/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2S47YFIG6D6QW6CNGCSBEMMA3B/action/storage_attestation","attest_author":"https://pith.science/pith/2S47YFIG6D6QW6CNGCSBEMMA3B/action/author_attestation","sign_citation":"https://pith.science/pith/2S47YFIG6D6QW6CNGCSBEMMA3B/action/citation_signature","submit_replication":"https://pith.science/pith/2S47YFIG6D6QW6CNGCSBEMMA3B/action/replication_record"}},"created_at":"2026-05-18T02:17:13.376923+00:00","updated_at":"2026-05-18T02:17:13.376923+00:00"}