{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:I5TXXRDZJQXGIDTDKBCYQYBBCQ","short_pith_number":"pith:I5TXXRDZ","canonical_record":{"source":{"id":"1412.1639","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-04T12:20:41Z","cross_cats_sorted":[],"title_canon_sha256":"d2fa8d8e343c51d86ae4f76d9061a8e24aa795a738e55002cc1d5f334b220348","abstract_canon_sha256":"81778e7066e9ab5fb07d458798121e248a9b032529f62fd6b93873b2abd4450a"},"schema_version":"1.0"},"canonical_sha256":"47677bc4794c2e640e6350458860211406d1648b56100002724855eeec9293d1","source":{"kind":"arxiv","id":"1412.1639","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.1639","created_at":"2026-05-18T02:25:55Z"},{"alias_kind":"arxiv_version","alias_value":"1412.1639v2","created_at":"2026-05-18T02:25:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.1639","created_at":"2026-05-18T02:25:55Z"},{"alias_kind":"pith_short_12","alias_value":"I5TXXRDZJQXG","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"I5TXXRDZJQXGIDTD","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"I5TXXRDZ","created_at":"2026-05-18T12:28:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:I5TXXRDZJQXGIDTDKBCYQYBBCQ","target":"record","payload":{"canonical_record":{"source":{"id":"1412.1639","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-04T12:20:41Z","cross_cats_sorted":[],"title_canon_sha256":"d2fa8d8e343c51d86ae4f76d9061a8e24aa795a738e55002cc1d5f334b220348","abstract_canon_sha256":"81778e7066e9ab5fb07d458798121e248a9b032529f62fd6b93873b2abd4450a"},"schema_version":"1.0"},"canonical_sha256":"47677bc4794c2e640e6350458860211406d1648b56100002724855eeec9293d1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:25:55.731256Z","signature_b64":"+ItGXDKygF+Hl9E3G4glFcJn2Lt04DwN1BwSRphDvfytfxWepPN2xV6T/AHOPM+0yy5nB3uHm7rqivJBxxdiBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"47677bc4794c2e640e6350458860211406d1648b56100002724855eeec9293d1","last_reissued_at":"2026-05-18T02:25:55.730899Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:25:55.730899Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1412.1639","source_version":2,"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-18T02:25:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sqX59V5G1kclwYErn96vioEjObaaOWSlbbMvv31UKu1TDKsCvNHTyaNiiDScf0MFLlWU8qRUzHiJ9hb0md7VDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T00:55:31.667784Z"},"content_sha256":"dd061e738ed695b6b31b507fa3ee7a2568f376558a706d192ca550a1036e8176","schema_version":"1.0","event_id":"sha256:dd061e738ed695b6b31b507fa3ee7a2568f376558a706d192ca550a1036e8176"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:I5TXXRDZJQXGIDTDKBCYQYBBCQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On testing single connectedness in directed graphs and some related problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Martin Dietzfelbinger, Raed Jaberi","submitted_at":"2014-12-04T12:20:41Z","abstract_excerpt":"Let $G=(V,E)$ be a directed graph with $n$ vertices and $m$ edges. The graph $G$ is called singly-connected if for each pair of vertices $v,w \\in V$ there is at most one simple path from $v$ to $w$ in $G$. Buchsbaum and Carlisle (1993) gave an algorithm for testing whether $G$ is singly-connected in $O(n^{2})$ time. In this paper we describe a refined version of this algorithm with running time $O(s\\cdot t+m)$, where $s$ and $t$ are the number of sources and sinks, respectively, in the reduced graph $G^{r}$ obtained by first contracting each strongly connected component of $G$ into one vertex "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.1639","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"},"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-18T02:25:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DbnE3SyXCiGoK0/zvvechTJz7unYqcehWuyWUdMLYExT6L7kkTxd69JZiTNnwUdvlELV3uNrUxE3ocbZQMY9AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T00:55:31.668132Z"},"content_sha256":"c0a553edca0b2060b8513ce5804e21103f8bdcd86ad7525997b36793e56eeca5","schema_version":"1.0","event_id":"sha256:c0a553edca0b2060b8513ce5804e21103f8bdcd86ad7525997b36793e56eeca5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/I5TXXRDZJQXGIDTDKBCYQYBBCQ/bundle.json","state_url":"https://pith.science/pith/I5TXXRDZJQXGIDTDKBCYQYBBCQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/I5TXXRDZJQXGIDTDKBCYQYBBCQ/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-06-26T00:55:31Z","links":{"resolver":"https://pith.science/pith/I5TXXRDZJQXGIDTDKBCYQYBBCQ","bundle":"https://pith.science/pith/I5TXXRDZJQXGIDTDKBCYQYBBCQ/bundle.json","state":"https://pith.science/pith/I5TXXRDZJQXGIDTDKBCYQYBBCQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/I5TXXRDZJQXGIDTDKBCYQYBBCQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:I5TXXRDZJQXGIDTDKBCYQYBBCQ","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":"81778e7066e9ab5fb07d458798121e248a9b032529f62fd6b93873b2abd4450a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-04T12:20:41Z","title_canon_sha256":"d2fa8d8e343c51d86ae4f76d9061a8e24aa795a738e55002cc1d5f334b220348"},"schema_version":"1.0","source":{"id":"1412.1639","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.1639","created_at":"2026-05-18T02:25:55Z"},{"alias_kind":"arxiv_version","alias_value":"1412.1639v2","created_at":"2026-05-18T02:25:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.1639","created_at":"2026-05-18T02:25:55Z"},{"alias_kind":"pith_short_12","alias_value":"I5TXXRDZJQXG","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"I5TXXRDZJQXGIDTD","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"I5TXXRDZ","created_at":"2026-05-18T12:28:33Z"}],"graph_snapshots":[{"event_id":"sha256:c0a553edca0b2060b8513ce5804e21103f8bdcd86ad7525997b36793e56eeca5","target":"graph","created_at":"2026-05-18T02:25:55Z","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":"Let $G=(V,E)$ be a directed graph with $n$ vertices and $m$ edges. The graph $G$ is called singly-connected if for each pair of vertices $v,w \\in V$ there is at most one simple path from $v$ to $w$ in $G$. Buchsbaum and Carlisle (1993) gave an algorithm for testing whether $G$ is singly-connected in $O(n^{2})$ time. In this paper we describe a refined version of this algorithm with running time $O(s\\cdot t+m)$, where $s$ and $t$ are the number of sources and sinks, respectively, in the reduced graph $G^{r}$ obtained by first contracting each strongly connected component of $G$ into one vertex ","authors_text":"Martin Dietzfelbinger, Raed Jaberi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-04T12:20:41Z","title":"On testing single connectedness in directed graphs and some related problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.1639","kind":"arxiv","version":2},"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:dd061e738ed695b6b31b507fa3ee7a2568f376558a706d192ca550a1036e8176","target":"record","created_at":"2026-05-18T02:25:55Z","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":"81778e7066e9ab5fb07d458798121e248a9b032529f62fd6b93873b2abd4450a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-04T12:20:41Z","title_canon_sha256":"d2fa8d8e343c51d86ae4f76d9061a8e24aa795a738e55002cc1d5f334b220348"},"schema_version":"1.0","source":{"id":"1412.1639","kind":"arxiv","version":2}},"canonical_sha256":"47677bc4794c2e640e6350458860211406d1648b56100002724855eeec9293d1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"47677bc4794c2e640e6350458860211406d1648b56100002724855eeec9293d1","first_computed_at":"2026-05-18T02:25:55.730899Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:25:55.730899Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+ItGXDKygF+Hl9E3G4glFcJn2Lt04DwN1BwSRphDvfytfxWepPN2xV6T/AHOPM+0yy5nB3uHm7rqivJBxxdiBg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:25:55.731256Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.1639","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dd061e738ed695b6b31b507fa3ee7a2568f376558a706d192ca550a1036e8176","sha256:c0a553edca0b2060b8513ce5804e21103f8bdcd86ad7525997b36793e56eeca5"],"state_sha256":"5c39946a4840d889bb528898b7faafbdd7262fb83d0ed10d2e1a4668b3ecfad0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0ijXs1Xpx/0NhGraRqqwrZIdXO95wkIfDMyM6nSikMekBxwTo9qvxzUSfxNBvC/kkminjx2NC5aRkMxyEUuMDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T00:55:31.670064Z","bundle_sha256":"19c2d94f594c5771fa2831695c12a8879c5fe2566da6eb2e5d8e0eaa69b17918"}}