{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:FOMHIPEGVSSVI7FJX3U7MRCOMO","short_pith_number":"pith:FOMHIPEG","schema_version":"1.0","canonical_sha256":"2b98743c86aca5547ca9bee9f6444e638a14e7ffcef34064228116ce05ceb910","source":{"kind":"arxiv","id":"1803.04282","version":4},"attestation_state":"computed","paper":{"title":"Linear-Time In-Place DFS and BFS on the Word RAM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andrej Sajenko, Frank Kammer","submitted_at":"2018-03-12T14:29:54Z","abstract_excerpt":"We present an in-place depth first search (DFS) and an in-place breadth first search (BFS) that runs on a word RAM in linear time such that, if the adjacency arrays of the input graph are given in a sorted order, the input is restored after running the algorithm. To obtain our results we use properties of the representation used to store the given graph and show several linear-time in-place graph transformations from one representation into another."},"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":"1803.04282","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-03-12T14:29:54Z","cross_cats_sorted":[],"title_canon_sha256":"6c17ed0b663fbd3f6ad2dfe9a0a4940b255506b8e81fba3e6247fe236ff647f0","abstract_canon_sha256":"ba0b5c6f8f04ee91f68b207bbc5d2d12c51cbedd6cbfb194c715479df79f75b8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:21.153972Z","signature_b64":"CVK1JZf8PKIe4GJSDLgIR18/jd1E808aDM/f75aOmoFfGVFbMyXWD33nw+pt6+TUn7EDlMNdGEK/GNp7kJN0AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2b98743c86aca5547ca9bee9f6444e638a14e7ffcef34064228116ce05ceb910","last_reissued_at":"2026-05-17T23:55:21.153610Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:21.153610Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Linear-Time In-Place DFS and BFS on the Word RAM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andrej Sajenko, Frank Kammer","submitted_at":"2018-03-12T14:29:54Z","abstract_excerpt":"We present an in-place depth first search (DFS) and an in-place breadth first search (BFS) that runs on a word RAM in linear time such that, if the adjacency arrays of the input graph are given in a sorted order, the input is restored after running the algorithm. To obtain our results we use properties of the representation used to store the given graph and show several linear-time in-place graph transformations from one representation into another."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.04282","kind":"arxiv","version":4},"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":"1803.04282","created_at":"2026-05-17T23:55:21.153671+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.04282v4","created_at":"2026-05-17T23:55:21.153671+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.04282","created_at":"2026-05-17T23:55:21.153671+00:00"},{"alias_kind":"pith_short_12","alias_value":"FOMHIPEGVSSV","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_16","alias_value":"FOMHIPEGVSSVI7FJ","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_8","alias_value":"FOMHIPEG","created_at":"2026-05-18T12:32:25.280505+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/FOMHIPEGVSSVI7FJX3U7MRCOMO","json":"https://pith.science/pith/FOMHIPEGVSSVI7FJX3U7MRCOMO.json","graph_json":"https://pith.science/api/pith-number/FOMHIPEGVSSVI7FJX3U7MRCOMO/graph.json","events_json":"https://pith.science/api/pith-number/FOMHIPEGVSSVI7FJX3U7MRCOMO/events.json","paper":"https://pith.science/paper/FOMHIPEG"},"agent_actions":{"view_html":"https://pith.science/pith/FOMHIPEGVSSVI7FJX3U7MRCOMO","download_json":"https://pith.science/pith/FOMHIPEGVSSVI7FJX3U7MRCOMO.json","view_paper":"https://pith.science/paper/FOMHIPEG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.04282&json=true","fetch_graph":"https://pith.science/api/pith-number/FOMHIPEGVSSVI7FJX3U7MRCOMO/graph.json","fetch_events":"https://pith.science/api/pith-number/FOMHIPEGVSSVI7FJX3U7MRCOMO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FOMHIPEGVSSVI7FJX3U7MRCOMO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FOMHIPEGVSSVI7FJX3U7MRCOMO/action/storage_attestation","attest_author":"https://pith.science/pith/FOMHIPEGVSSVI7FJX3U7MRCOMO/action/author_attestation","sign_citation":"https://pith.science/pith/FOMHIPEGVSSVI7FJX3U7MRCOMO/action/citation_signature","submit_replication":"https://pith.science/pith/FOMHIPEGVSSVI7FJX3U7MRCOMO/action/replication_record"}},"created_at":"2026-05-17T23:55:21.153671+00:00","updated_at":"2026-05-17T23:55:21.153671+00:00"}