{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:BXXOCZ7GA3LPLJH375GRUWK2OU","short_pith_number":"pith:BXXOCZ7G","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"},"canonical_sha256":"0deee167e606d6f5a4fbff4d1a595a75311edf31b1759852a6a6013f8aad8ed9","source":{"kind":"arxiv","id":"1907.09280","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.09280","created_at":"2026-05-17T23:39:59Z"},{"alias_kind":"arxiv_version","alias_value":"1907.09280v1","created_at":"2026-05-17T23:39:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.09280","created_at":"2026-05-17T23:39:59Z"},{"alias_kind":"pith_short_12","alias_value":"BXXOCZ7GA3LP","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"BXXOCZ7GA3LPLJH3","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"BXXOCZ7G","created_at":"2026-05-18T12:33:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:BXXOCZ7GA3LPLJH375GRUWK2OU","target":"record","payload":{"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"},"canonical_sha256":"0deee167e606d6f5a4fbff4d1a595a75311edf31b1759852a6a6013f8aad8ed9","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"},"source_kind":"arxiv","source_id":"1907.09280","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:39:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bDgmxOC+8s2zBAYJBhczdyDTGjqCOeGK4LbSJBcICmPo6c5pP2CAKwJldBLMmcdl6/Hrycquk/CY4AYd4HjxCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T06:16:00.897268Z"},"content_sha256":"bedc68d3137f16212ed9d61dcac434218f2d6d8ab67650e6178033d907f298cb","schema_version":"1.0","event_id":"sha256:bedc68d3137f16212ed9d61dcac434218f2d6d8ab67650e6178033d907f298cb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:BXXOCZ7GA3LPLJH375GRUWK2OU","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:39:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6Pw/dTysvOrcKs0cFOTSUYNM2I0cwz9shY0IM2gDEkrbjD7W8l6Zy+nr0xFTu7IFWUBkeR6ELdmfoALuu9MuCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T06:16:00.897687Z"},"content_sha256":"1b3e3ab39efc3c9560c2497a33ba56ff17c547286dde09fb2ae92a1def477ae0","schema_version":"1.0","event_id":"sha256:1b3e3ab39efc3c9560c2497a33ba56ff17c547286dde09fb2ae92a1def477ae0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BXXOCZ7GA3LPLJH375GRUWK2OU/bundle.json","state_url":"https://pith.science/pith/BXXOCZ7GA3LPLJH375GRUWK2OU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BXXOCZ7GA3LPLJH375GRUWK2OU/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-30T06:16:00Z","links":{"resolver":"https://pith.science/pith/BXXOCZ7GA3LPLJH375GRUWK2OU","bundle":"https://pith.science/pith/BXXOCZ7GA3LPLJH375GRUWK2OU/bundle.json","state":"https://pith.science/pith/BXXOCZ7GA3LPLJH375GRUWK2OU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BXXOCZ7GA3LPLJH375GRUWK2OU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:BXXOCZ7GA3LPLJH375GRUWK2OU","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"6e3d8b55d48b9838ebe047ff320cb7119e9273ce209184c13b9dcc1e6c1be125","cross_cats_sorted":["cs.CC","cs.IR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-22T12:41:59Z","title_canon_sha256":"c29c47059a29c61986270e91b398f8f637a25c17fda6785fbf93a19857b6ffe8"},"schema_version":"1.0","source":{"id":"1907.09280","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.09280","created_at":"2026-05-17T23:39:59Z"},{"alias_kind":"arxiv_version","alias_value":"1907.09280v1","created_at":"2026-05-17T23:39:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.09280","created_at":"2026-05-17T23:39:59Z"},{"alias_kind":"pith_short_12","alias_value":"BXXOCZ7GA3LP","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"BXXOCZ7GA3LPLJH3","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"BXXOCZ7G","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:1b3e3ab39efc3c9560c2497a33ba56ff17c547286dde09fb2ae92a1def477ae0","target":"graph","created_at":"2026-05-17T23:39:59Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Kunihiko Sadakane, Sankardeep Chakraborty, Srinivasa Rao Satti","cross_cats":["cs.CC","cs.IR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-22T12:41:59Z","title":"Optimal In-place Algorithms for Basic Graph Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.09280","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:bedc68d3137f16212ed9d61dcac434218f2d6d8ab67650e6178033d907f298cb","target":"record","created_at":"2026-05-17T23:39:59Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"6e3d8b55d48b9838ebe047ff320cb7119e9273ce209184c13b9dcc1e6c1be125","cross_cats_sorted":["cs.CC","cs.IR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-22T12:41:59Z","title_canon_sha256":"c29c47059a29c61986270e91b398f8f637a25c17fda6785fbf93a19857b6ffe8"},"schema_version":"1.0","source":{"id":"1907.09280","kind":"arxiv","version":1}},"canonical_sha256":"0deee167e606d6f5a4fbff4d1a595a75311edf31b1759852a6a6013f8aad8ed9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0deee167e606d6f5a4fbff4d1a595a75311edf31b1759852a6a6013f8aad8ed9","first_computed_at":"2026-05-17T23:39:59.630604Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:59.630604Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Im9l7PjG5dbI9Bn/OU30WagybVl5qE3lBwzSw8fl4SocbDQjkzZF7t9AQrT2+WSBa5DVS8yFiWtXO1zmWzu+Aw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:59.631146Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.09280","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bedc68d3137f16212ed9d61dcac434218f2d6d8ab67650e6178033d907f298cb","sha256:1b3e3ab39efc3c9560c2497a33ba56ff17c547286dde09fb2ae92a1def477ae0"],"state_sha256":"667be28be3ddec18bbe6a755f459fe4cce851baa26c83ccd8e685dceaebf7224"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2OLsO58GGBRO/jRmNpLg6MQclYKdyeKbdwXWdjwWo/SfvDyva6G3VSr6/7yFb7rBEl3yWWodfYZrBBd2JI7qBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T06:16:00.899869Z","bundle_sha256":"4c8cd08f9c23c5fb481a99cf15bf2cb0acc450c38615ee9293cc433910fe2023"}}