{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:NT2KS7VF4OUV64IZTR6K6VINGH","short_pith_number":"pith:NT2KS7VF","schema_version":"1.0","canonical_sha256":"6cf4a97ea5e3a95f71199c7caf550d31f92782d9d4f944187a42f0f814c8f5cc","source":{"kind":"arxiv","id":"1204.3113","version":1},"attestation_state":"computed","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 "},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1204.3113","created_at":"2026-05-18T03:57:52.574044+00:00"},{"alias_kind":"arxiv_version","alias_value":"1204.3113v1","created_at":"2026-05-18T03:57:52.574044+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.3113","created_at":"2026-05-18T03:57:52.574044+00:00"},{"alias_kind":"pith_short_12","alias_value":"NT2KS7VF4OUV","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_16","alias_value":"NT2KS7VF4OUV64IZ","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_8","alias_value":"NT2KS7VF","created_at":"2026-05-18T12:27:16.716162+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/NT2KS7VF4OUV64IZTR6K6VINGH","json":"https://pith.science/pith/NT2KS7VF4OUV64IZTR6K6VINGH.json","graph_json":"https://pith.science/api/pith-number/NT2KS7VF4OUV64IZTR6K6VINGH/graph.json","events_json":"https://pith.science/api/pith-number/NT2KS7VF4OUV64IZTR6K6VINGH/events.json","paper":"https://pith.science/paper/NT2KS7VF"},"agent_actions":{"view_html":"https://pith.science/pith/NT2KS7VF4OUV64IZTR6K6VINGH","download_json":"https://pith.science/pith/NT2KS7VF4OUV64IZTR6K6VINGH.json","view_paper":"https://pith.science/paper/NT2KS7VF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1204.3113&json=true","fetch_graph":"https://pith.science/api/pith-number/NT2KS7VF4OUV64IZTR6K6VINGH/graph.json","fetch_events":"https://pith.science/api/pith-number/NT2KS7VF4OUV64IZTR6K6VINGH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NT2KS7VF4OUV64IZTR6K6VINGH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NT2KS7VF4OUV64IZTR6K6VINGH/action/storage_attestation","attest_author":"https://pith.science/pith/NT2KS7VF4OUV64IZTR6K6VINGH/action/author_attestation","sign_citation":"https://pith.science/pith/NT2KS7VF4OUV64IZTR6K6VINGH/action/citation_signature","submit_replication":"https://pith.science/pith/NT2KS7VF4OUV64IZTR6K6VINGH/action/replication_record"}},"created_at":"2026-05-18T03:57:52.574044+00:00","updated_at":"2026-05-18T03:57:52.574044+00:00"}