{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:KLRYZ5DP6EB7IEGQ22UUBJU3BJ","short_pith_number":"pith:KLRYZ5DP","schema_version":"1.0","canonical_sha256":"52e38cf46ff103f410d0d6a940a69b0a4d59a8ae813e17667cf5a53acf63c7f8","source":{"kind":"arxiv","id":"1712.03349","version":1},"attestation_state":"computed","paper":{"title":"Improved Space-efficient Linear Time Algorithms for Some Classical Graph Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Sankardeep Chakraborty, Seungbum Jo, Srinivasa Rao Satti","submitted_at":"2017-12-09T07:11:11Z","abstract_excerpt":"This short note provides space-efficient linear time algorithms for computing bridges, topological sorting, and strongly connected components improving on several recent results of Elmasry et al. [STACS'15], Banerjee et al. [COCOON'16] and Chakraborty et al. [ISAAC'16]. En route, we also provide another DFS implementation with weaker input graph representation assumption without compromising on the time and space bounds of the earlier results of Banerjee et al. [COCOON'16] and Kammer et al. [MFCS'16]."},"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":"1712.03349","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-12-09T07:11:11Z","cross_cats_sorted":[],"title_canon_sha256":"70d3a07cb347b15e4848a719ae213d7fe1881d402dfe0b40fbda5b5df85b666a","abstract_canon_sha256":"9d3ea3cf8941a0a2fe552f9c4338ae8abf8647872994e3f26082e436ae13c540"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:28:21.581811Z","signature_b64":"RkNRRj36SYpSapy8mDBe4r5DTGwvsPQWm5v6jmYne7IuIKTdaCRemCL1T/q8ndBSHVcRTCrW6c2R1pcDoQaFBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"52e38cf46ff103f410d0d6a940a69b0a4d59a8ae813e17667cf5a53acf63c7f8","last_reissued_at":"2026-05-18T00:28:21.581164Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:28:21.581164Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved Space-efficient Linear Time Algorithms for Some Classical Graph Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Sankardeep Chakraborty, Seungbum Jo, Srinivasa Rao Satti","submitted_at":"2017-12-09T07:11:11Z","abstract_excerpt":"This short note provides space-efficient linear time algorithms for computing bridges, topological sorting, and strongly connected components improving on several recent results of Elmasry et al. [STACS'15], Banerjee et al. [COCOON'16] and Chakraborty et al. [ISAAC'16]. En route, we also provide another DFS implementation with weaker input graph representation assumption without compromising on the time and space bounds of the earlier results of Banerjee et al. [COCOON'16] and Kammer et al. [MFCS'16]."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.03349","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":"1712.03349","created_at":"2026-05-18T00:28:21.581257+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.03349v1","created_at":"2026-05-18T00:28:21.581257+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.03349","created_at":"2026-05-18T00:28:21.581257+00:00"},{"alias_kind":"pith_short_12","alias_value":"KLRYZ5DP6EB7","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_16","alias_value":"KLRYZ5DP6EB7IEGQ","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_8","alias_value":"KLRYZ5DP","created_at":"2026-05-18T12:31:24.725408+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/KLRYZ5DP6EB7IEGQ22UUBJU3BJ","json":"https://pith.science/pith/KLRYZ5DP6EB7IEGQ22UUBJU3BJ.json","graph_json":"https://pith.science/api/pith-number/KLRYZ5DP6EB7IEGQ22UUBJU3BJ/graph.json","events_json":"https://pith.science/api/pith-number/KLRYZ5DP6EB7IEGQ22UUBJU3BJ/events.json","paper":"https://pith.science/paper/KLRYZ5DP"},"agent_actions":{"view_html":"https://pith.science/pith/KLRYZ5DP6EB7IEGQ22UUBJU3BJ","download_json":"https://pith.science/pith/KLRYZ5DP6EB7IEGQ22UUBJU3BJ.json","view_paper":"https://pith.science/paper/KLRYZ5DP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.03349&json=true","fetch_graph":"https://pith.science/api/pith-number/KLRYZ5DP6EB7IEGQ22UUBJU3BJ/graph.json","fetch_events":"https://pith.science/api/pith-number/KLRYZ5DP6EB7IEGQ22UUBJU3BJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KLRYZ5DP6EB7IEGQ22UUBJU3BJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KLRYZ5DP6EB7IEGQ22UUBJU3BJ/action/storage_attestation","attest_author":"https://pith.science/pith/KLRYZ5DP6EB7IEGQ22UUBJU3BJ/action/author_attestation","sign_citation":"https://pith.science/pith/KLRYZ5DP6EB7IEGQ22UUBJU3BJ/action/citation_signature","submit_replication":"https://pith.science/pith/KLRYZ5DP6EB7IEGQ22UUBJU3BJ/action/replication_record"}},"created_at":"2026-05-18T00:28:21.581257+00:00","updated_at":"2026-05-18T00:28:21.581257+00:00"}