{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:LTIQ7TKLWHVBY4KN7OTZU23B3H","short_pith_number":"pith:LTIQ7TKL","schema_version":"1.0","canonical_sha256":"5cd10fcd4bb1ea1c714dfba79a6b61d9cf6b9566e340693a594dea0a2e8a8d43","source":{"kind":"arxiv","id":"1812.10950","version":2},"attestation_state":"computed","paper":{"title":"Fast Breadth-First Search in Still Less Space","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Torben Hagerup","submitted_at":"2018-12-28T10:43:12Z","abstract_excerpt":"It is shown that a breadth-first search in a directed or undirected graph with $n$ vertices and $m$ edges can be carried out in $O(n+m)$ time with $n\\log_2 3+O((\\log n)^2)$ bits of working memory."},"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":"1812.10950","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-12-28T10:43:12Z","cross_cats_sorted":[],"title_canon_sha256":"9174caa198b76ebbb9029d0230ae0b3f952ec3801cf99b42955d52fed8172aec","abstract_canon_sha256":"0bd4045fa84f72627feaf462638f9a9083a8a8d7a55fad715876a014b4b21613"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:55.499195Z","signature_b64":"61EDCSvk3FQyKdbNrvbK+VYXKzq91MvB+F8XeBkOxiD2+5M7k6LRiDX+5SITu2BSqfO34n0TfbVZsdfgFEXPAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5cd10fcd4bb1ea1c714dfba79a6b61d9cf6b9566e340693a594dea0a2e8a8d43","last_reissued_at":"2026-05-17T23:53:55.498671Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:55.498671Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Breadth-First Search in Still Less Space","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Torben Hagerup","submitted_at":"2018-12-28T10:43:12Z","abstract_excerpt":"It is shown that a breadth-first search in a directed or undirected graph with $n$ vertices and $m$ edges can be carried out in $O(n+m)$ time with $n\\log_2 3+O((\\log n)^2)$ bits of working memory."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.10950","kind":"arxiv","version":2},"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":"1812.10950","created_at":"2026-05-17T23:53:55.498769+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.10950v2","created_at":"2026-05-17T23:53:55.498769+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.10950","created_at":"2026-05-17T23:53:55.498769+00:00"},{"alias_kind":"pith_short_12","alias_value":"LTIQ7TKLWHVB","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_16","alias_value":"LTIQ7TKLWHVBY4KN","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_8","alias_value":"LTIQ7TKL","created_at":"2026-05-18T12:32:37.024351+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/LTIQ7TKLWHVBY4KN7OTZU23B3H","json":"https://pith.science/pith/LTIQ7TKLWHVBY4KN7OTZU23B3H.json","graph_json":"https://pith.science/api/pith-number/LTIQ7TKLWHVBY4KN7OTZU23B3H/graph.json","events_json":"https://pith.science/api/pith-number/LTIQ7TKLWHVBY4KN7OTZU23B3H/events.json","paper":"https://pith.science/paper/LTIQ7TKL"},"agent_actions":{"view_html":"https://pith.science/pith/LTIQ7TKLWHVBY4KN7OTZU23B3H","download_json":"https://pith.science/pith/LTIQ7TKLWHVBY4KN7OTZU23B3H.json","view_paper":"https://pith.science/paper/LTIQ7TKL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.10950&json=true","fetch_graph":"https://pith.science/api/pith-number/LTIQ7TKLWHVBY4KN7OTZU23B3H/graph.json","fetch_events":"https://pith.science/api/pith-number/LTIQ7TKLWHVBY4KN7OTZU23B3H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LTIQ7TKLWHVBY4KN7OTZU23B3H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LTIQ7TKLWHVBY4KN7OTZU23B3H/action/storage_attestation","attest_author":"https://pith.science/pith/LTIQ7TKLWHVBY4KN7OTZU23B3H/action/author_attestation","sign_citation":"https://pith.science/pith/LTIQ7TKLWHVBY4KN7OTZU23B3H/action/citation_signature","submit_replication":"https://pith.science/pith/LTIQ7TKLWHVBY4KN7OTZU23B3H/action/replication_record"}},"created_at":"2026-05-17T23:53:55.498769+00:00","updated_at":"2026-05-17T23:53:55.498769+00:00"}