{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:NT2KS7VF4OUV64IZTR6K6VINGH","short_pith_number":"pith:NT2KS7VF","canonical_record":{"source":{"id":"1204.3113","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-04-13T21:43:31Z","cross_cats_sorted":[],"title_canon_sha256":"865fda2ea2df766b25fbdb253d552e984cfaa2942911f61786618dcca98bd519","abstract_canon_sha256":"16d54367d1e1526f34edf88b93620b78689f03f8a2c639e2843da74eb2ca4a7c"},"schema_version":"1.0"},"canonical_sha256":"6cf4a97ea5e3a95f71199c7caf550d31f92782d9d4f944187a42f0f814c8f5cc","source":{"kind":"arxiv","id":"1204.3113","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.3113","created_at":"2026-05-18T03:57:52Z"},{"alias_kind":"arxiv_version","alias_value":"1204.3113v1","created_at":"2026-05-18T03:57:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.3113","created_at":"2026-05-18T03:57:52Z"},{"alias_kind":"pith_short_12","alias_value":"NT2KS7VF4OUV","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"NT2KS7VF4OUV64IZ","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"NT2KS7VF","created_at":"2026-05-18T12:27:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:NT2KS7VF4OUV64IZTR6K6VINGH","target":"record","payload":{"canonical_record":{"source":{"id":"1204.3113","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-04-13T21:43:31Z","cross_cats_sorted":[],"title_canon_sha256":"865fda2ea2df766b25fbdb253d552e984cfaa2942911f61786618dcca98bd519","abstract_canon_sha256":"16d54367d1e1526f34edf88b93620b78689f03f8a2c639e2843da74eb2ca4a7c"},"schema_version":"1.0"},"canonical_sha256":"6cf4a97ea5e3a95f71199c7caf550d31f92782d9d4f944187a42f0f814c8f5cc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:57:52.574907Z","signature_b64":"QOhtQeyj+q9O7sLI5w7fUyrh4uTLDBOv5wX9gXZ1ROf6oexVSBClznykvIsmxXQ6hpNd7VCBZQ0zPDU/bWj0Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6cf4a97ea5e3a95f71199c7caf550d31f92782d9d4f944187a42f0f814c8f5cc","last_reissued_at":"2026-05-18T03:57:52.573880Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:57:52.573880Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1204.3113","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-18T03:57:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kZjK/j9cpzecAbIBpt70ijWNVXBTgiaCFAPk8cFb0X52HCjrhFpkpOT7Nee4hZGtwRGlyRfTFtdOHXdpYCsxDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T09:57:04.176604Z"},"content_sha256":"a0fe9258307a5f357c4f2afeb4f3c1f110c27f8e75df904c2b9536f689803f72","schema_version":"1.0","event_id":"sha256:a0fe9258307a5f357c4f2afeb4f3c1f110c27f8e75df904c2b9536f689803f72"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:NT2KS7VF4OUV64IZTR6K6VINGH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Algorithms for Junctions in Directed Acyclic Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"\\'Alvaro Junio Pereira Franco, Carlos Eduardo Ferreira","submitted_at":"2012-04-13T21:43:31Z","abstract_excerpt":"Given a pair of distinct vertices u, v in a graph G, we say that s is a junction of u, v if there are in G internally vertex disjoint directed paths from s to u and from s to v. We show how to characterize junctions in directed acyclic graphs. We also consider the two problems in the following and derive efficient algorithms to solve them. Given a directed acyclic graph G and a vertex s in G, how can we find all pairs of vertices of G such that s is a junction of them? And given a directed acyclic graph G and k pairs of vertices of G, how can we preprocess G such that all junctions of k given "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.3113","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-18T03:57:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bqYpA7Ggcy6+Z7qkFnqsRHfUJvYubyIWJdhgxEnUra053yYP25VLKILxhHtnv3gLNbzxBRdwIiBTxog9sMHHBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T09:57:04.176952Z"},"content_sha256":"06fa09cb95df1bce2035c7cbb9435aeb9510ca9c87cc7ba3b3b91c4cfc9b44a8","schema_version":"1.0","event_id":"sha256:06fa09cb95df1bce2035c7cbb9435aeb9510ca9c87cc7ba3b3b91c4cfc9b44a8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NT2KS7VF4OUV64IZTR6K6VINGH/bundle.json","state_url":"https://pith.science/pith/NT2KS7VF4OUV64IZTR6K6VINGH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NT2KS7VF4OUV64IZTR6K6VINGH/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-29T09:57:04Z","links":{"resolver":"https://pith.science/pith/NT2KS7VF4OUV64IZTR6K6VINGH","bundle":"https://pith.science/pith/NT2KS7VF4OUV64IZTR6K6VINGH/bundle.json","state":"https://pith.science/pith/NT2KS7VF4OUV64IZTR6K6VINGH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NT2KS7VF4OUV64IZTR6K6VINGH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:NT2KS7VF4OUV64IZTR6K6VINGH","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":"16d54367d1e1526f34edf88b93620b78689f03f8a2c639e2843da74eb2ca4a7c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-04-13T21:43:31Z","title_canon_sha256":"865fda2ea2df766b25fbdb253d552e984cfaa2942911f61786618dcca98bd519"},"schema_version":"1.0","source":{"id":"1204.3113","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.3113","created_at":"2026-05-18T03:57:52Z"},{"alias_kind":"arxiv_version","alias_value":"1204.3113v1","created_at":"2026-05-18T03:57:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.3113","created_at":"2026-05-18T03:57:52Z"},{"alias_kind":"pith_short_12","alias_value":"NT2KS7VF4OUV","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"NT2KS7VF4OUV64IZ","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"NT2KS7VF","created_at":"2026-05-18T12:27:16Z"}],"graph_snapshots":[{"event_id":"sha256:06fa09cb95df1bce2035c7cbb9435aeb9510ca9c87cc7ba3b3b91c4cfc9b44a8","target":"graph","created_at":"2026-05-18T03:57:52Z","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":"Given a pair of distinct vertices u, v in a graph G, we say that s is a junction of u, v if there are in G internally vertex disjoint directed paths from s to u and from s to v. We show how to characterize junctions in directed acyclic graphs. We also consider the two problems in the following and derive efficient algorithms to solve them. Given a directed acyclic graph G and a vertex s in G, how can we find all pairs of vertices of G such that s is a junction of them? And given a directed acyclic graph G and k pairs of vertices of G, how can we preprocess G such that all junctions of k given ","authors_text":"\\'Alvaro Junio Pereira Franco, Carlos Eduardo Ferreira","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-04-13T21:43:31Z","title":"Algorithms for Junctions in Directed Acyclic Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.3113","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:a0fe9258307a5f357c4f2afeb4f3c1f110c27f8e75df904c2b9536f689803f72","target":"record","created_at":"2026-05-18T03:57:52Z","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":"16d54367d1e1526f34edf88b93620b78689f03f8a2c639e2843da74eb2ca4a7c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-04-13T21:43:31Z","title_canon_sha256":"865fda2ea2df766b25fbdb253d552e984cfaa2942911f61786618dcca98bd519"},"schema_version":"1.0","source":{"id":"1204.3113","kind":"arxiv","version":1}},"canonical_sha256":"6cf4a97ea5e3a95f71199c7caf550d31f92782d9d4f944187a42f0f814c8f5cc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6cf4a97ea5e3a95f71199c7caf550d31f92782d9d4f944187a42f0f814c8f5cc","first_computed_at":"2026-05-18T03:57:52.573880Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:57:52.573880Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QOhtQeyj+q9O7sLI5w7fUyrh4uTLDBOv5wX9gXZ1ROf6oexVSBClznykvIsmxXQ6hpNd7VCBZQ0zPDU/bWj0Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:57:52.574907Z","signed_message":"canonical_sha256_bytes"},"source_id":"1204.3113","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a0fe9258307a5f357c4f2afeb4f3c1f110c27f8e75df904c2b9536f689803f72","sha256:06fa09cb95df1bce2035c7cbb9435aeb9510ca9c87cc7ba3b3b91c4cfc9b44a8"],"state_sha256":"afba14c47671ea5411ee5f9f26d8541d7b5b95a5a4521a49be2043f98bbfaaf2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FpXjUfk7yJRpOwft3F80Z/Dqxrkm/FAN82CtVQv7B+Aic0QpneI3qzn+7Z0/Yd4TaRwYc+cr6ohsNEikJHi7DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T09:57:04.178864Z","bundle_sha256":"afac8e50a2ebf2aadd7a7906f36f267ba3eb97d80afb4af8800875a9621c5732"}}