{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:BXXOCZ7GA3LPLJH375GRUWK2OU","short_pith_number":"pith:BXXOCZ7G","schema_version":"1.0","canonical_sha256":"0deee167e606d6f5a4fbff4d1a595a75311edf31b1759852a6a6013f8aad8ed9","source":{"kind":"arxiv","id":"1907.09280","version":1},"attestation_state":"computed","paper":{"title":"Optimal In-place Algorithms for Basic Graph Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.IR"],"primary_cat":"cs.DS","authors_text":"Kunihiko Sadakane, Sankardeep Chakraborty, Srinivasa Rao Satti","submitted_at":"2019-07-22T12:41:59Z","abstract_excerpt":"We present linear time {\\it in-place} algorithms for several basic and fundamental graph problems including the well-known graph search methods (like depth-first search, breadth-first search, maximum cardinality search), connectivity problems (like biconnectivity, $2$-edge connectivity), decomposition problem (like chain decomposition) among various others, improving the running time (by polynomial multiplicative factor) of the recent results of Chakraborty et al. [ESA, 2018] who designed $O(n^3 \\lg n)$ time in-place algorithms for a strict subset of the above mentioned problems. The running t"},"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":"1907.09280","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-22T12:41:59Z","cross_cats_sorted":["cs.CC","cs.IR"],"title_canon_sha256":"c29c47059a29c61986270e91b398f8f637a25c17fda6785fbf93a19857b6ffe8","abstract_canon_sha256":"6e3d8b55d48b9838ebe047ff320cb7119e9273ce209184c13b9dcc1e6c1be125"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:59.631146Z","signature_b64":"Im9l7PjG5dbI9Bn/OU30WagybVl5qE3lBwzSw8fl4SocbDQjkzZF7t9AQrT2+WSBa5DVS8yFiWtXO1zmWzu+Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0deee167e606d6f5a4fbff4d1a595a75311edf31b1759852a6a6013f8aad8ed9","last_reissued_at":"2026-05-17T23:39:59.630604Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:59.630604Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal In-place Algorithms for Basic Graph Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.IR"],"primary_cat":"cs.DS","authors_text":"Kunihiko Sadakane, Sankardeep Chakraborty, Srinivasa Rao Satti","submitted_at":"2019-07-22T12:41:59Z","abstract_excerpt":"We present linear time {\\it in-place} algorithms for several basic and fundamental graph problems including the well-known graph search methods (like depth-first search, breadth-first search, maximum cardinality search), connectivity problems (like biconnectivity, $2$-edge connectivity), decomposition problem (like chain decomposition) among various others, improving the running time (by polynomial multiplicative factor) of the recent results of Chakraborty et al. [ESA, 2018] who designed $O(n^3 \\lg n)$ time in-place algorithms for a strict subset of the above mentioned problems. The running t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.09280","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":"1907.09280","created_at":"2026-05-17T23:39:59.630689+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.09280v1","created_at":"2026-05-17T23:39:59.630689+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.09280","created_at":"2026-05-17T23:39:59.630689+00:00"},{"alias_kind":"pith_short_12","alias_value":"BXXOCZ7GA3LP","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_16","alias_value":"BXXOCZ7GA3LPLJH3","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_8","alias_value":"BXXOCZ7G","created_at":"2026-05-18T12:33:12.712433+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/BXXOCZ7GA3LPLJH375GRUWK2OU","json":"https://pith.science/pith/BXXOCZ7GA3LPLJH375GRUWK2OU.json","graph_json":"https://pith.science/api/pith-number/BXXOCZ7GA3LPLJH375GRUWK2OU/graph.json","events_json":"https://pith.science/api/pith-number/BXXOCZ7GA3LPLJH375GRUWK2OU/events.json","paper":"https://pith.science/paper/BXXOCZ7G"},"agent_actions":{"view_html":"https://pith.science/pith/BXXOCZ7GA3LPLJH375GRUWK2OU","download_json":"https://pith.science/pith/BXXOCZ7GA3LPLJH375GRUWK2OU.json","view_paper":"https://pith.science/paper/BXXOCZ7G","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.09280&json=true","fetch_graph":"https://pith.science/api/pith-number/BXXOCZ7GA3LPLJH375GRUWK2OU/graph.json","fetch_events":"https://pith.science/api/pith-number/BXXOCZ7GA3LPLJH375GRUWK2OU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BXXOCZ7GA3LPLJH375GRUWK2OU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BXXOCZ7GA3LPLJH375GRUWK2OU/action/storage_attestation","attest_author":"https://pith.science/pith/BXXOCZ7GA3LPLJH375GRUWK2OU/action/author_attestation","sign_citation":"https://pith.science/pith/BXXOCZ7GA3LPLJH375GRUWK2OU/action/citation_signature","submit_replication":"https://pith.science/pith/BXXOCZ7GA3LPLJH375GRUWK2OU/action/replication_record"}},"created_at":"2026-05-17T23:39:59.630689+00:00","updated_at":"2026-05-17T23:39:59.630689+00:00"}