{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:SJTGPMTGSJNNJDPDWE4VFAPH6O","short_pith_number":"pith:SJTGPMTG","schema_version":"1.0","canonical_sha256":"926667b266925ad48de3b1395281e7f389619616d084a7d2b20f233f3bdf48c7","source":{"kind":"arxiv","id":"1407.2569","version":3},"attestation_state":"computed","paper":{"title":"Replacing Mark Bits with Randomness in Fibonacci Heaps","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jerry Li, John Peebles","submitted_at":"2014-07-09T17:43:25Z","abstract_excerpt":"A Fibonacci heap is a deterministic data structure implementing a priority queue with optimal amortized operation costs. An unfortunate aspect of Fibonacci heaps is that they must maintain a \"mark bit\" which serves only to ensure efficiency of heap operations, not correctness. Karger proposed a simple randomized variant of Fibonacci heaps in which mark bits are replaced by coin flips. This variant still has expected amortized cost $O(1)$ for insert, decrease-key, and merge. Karger conjectured that this data structure has expected amortized cost $O(\\log s)$ for delete-min, where $s$ is the numb"},"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":"1407.2569","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-09T17:43:25Z","cross_cats_sorted":[],"title_canon_sha256":"9e35267f165baeb4a37d8398ef09c0c4aec72f46bd6871a77a5907972f711470","abstract_canon_sha256":"f4263a20ddd854639735698aa0ff4d78680a0654a312d12597d45908587a4cec"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:26:52.851307Z","signature_b64":"ZRHP/XU2Fh7ld2lbP6LUxMn7uf2oP3tgNtX1C6EiWW6nkiR0MniBknnMJ4HG7KAx7x7KxbrWJuUmyMdH4VyDCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"926667b266925ad48de3b1395281e7f389619616d084a7d2b20f233f3bdf48c7","last_reissued_at":"2026-05-18T02:26:52.850849Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:26:52.850849Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Replacing Mark Bits with Randomness in Fibonacci Heaps","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jerry Li, John Peebles","submitted_at":"2014-07-09T17:43:25Z","abstract_excerpt":"A Fibonacci heap is a deterministic data structure implementing a priority queue with optimal amortized operation costs. An unfortunate aspect of Fibonacci heaps is that they must maintain a \"mark bit\" which serves only to ensure efficiency of heap operations, not correctness. Karger proposed a simple randomized variant of Fibonacci heaps in which mark bits are replaced by coin flips. This variant still has expected amortized cost $O(1)$ for insert, decrease-key, and merge. Karger conjectured that this data structure has expected amortized cost $O(\\log s)$ for delete-min, where $s$ is the numb"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.2569","kind":"arxiv","version":3},"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":"1407.2569","created_at":"2026-05-18T02:26:52.850926+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.2569v3","created_at":"2026-05-18T02:26:52.850926+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.2569","created_at":"2026-05-18T02:26:52.850926+00:00"},{"alias_kind":"pith_short_12","alias_value":"SJTGPMTGSJNN","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_16","alias_value":"SJTGPMTGSJNNJDPD","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_8","alias_value":"SJTGPMTG","created_at":"2026-05-18T12:28:49.207871+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/SJTGPMTGSJNNJDPDWE4VFAPH6O","json":"https://pith.science/pith/SJTGPMTGSJNNJDPDWE4VFAPH6O.json","graph_json":"https://pith.science/api/pith-number/SJTGPMTGSJNNJDPDWE4VFAPH6O/graph.json","events_json":"https://pith.science/api/pith-number/SJTGPMTGSJNNJDPDWE4VFAPH6O/events.json","paper":"https://pith.science/paper/SJTGPMTG"},"agent_actions":{"view_html":"https://pith.science/pith/SJTGPMTGSJNNJDPDWE4VFAPH6O","download_json":"https://pith.science/pith/SJTGPMTGSJNNJDPDWE4VFAPH6O.json","view_paper":"https://pith.science/paper/SJTGPMTG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.2569&json=true","fetch_graph":"https://pith.science/api/pith-number/SJTGPMTGSJNNJDPDWE4VFAPH6O/graph.json","fetch_events":"https://pith.science/api/pith-number/SJTGPMTGSJNNJDPDWE4VFAPH6O/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SJTGPMTGSJNNJDPDWE4VFAPH6O/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SJTGPMTGSJNNJDPDWE4VFAPH6O/action/storage_attestation","attest_author":"https://pith.science/pith/SJTGPMTGSJNNJDPDWE4VFAPH6O/action/author_attestation","sign_citation":"https://pith.science/pith/SJTGPMTGSJNNJDPDWE4VFAPH6O/action/citation_signature","submit_replication":"https://pith.science/pith/SJTGPMTGSJNNJDPDWE4VFAPH6O/action/replication_record"}},"created_at":"2026-05-18T02:26:52.850926+00:00","updated_at":"2026-05-18T02:26:52.850926+00:00"}