{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:DBN6XOKL4PHTLBYQKAYCI6IXQU","short_pith_number":"pith:DBN6XOKL","schema_version":"1.0","canonical_sha256":"185bebb94be3cf35871050302479178521bb1e7902e5fccfaf61c8cebfb1b2f8","source":{"kind":"arxiv","id":"1107.3977","version":2},"attestation_state":"computed","paper":{"title":"Detecting 2-joins faster","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Kristina Vu\\v{s}kovi\\'c, Michel Habib, Nicolas Trotignon, Pierre Charbit","submitted_at":"2011-07-20T13:40:23Z","abstract_excerpt":"2-joins are edge cutsets that naturally appear in the decomposition of several classes of graphs closed under taking induced subgraphs, such as balanced bipartite graphs, even-hole-free graphs, perfect graphs and claw-free graphs. Their detection is needed in several algorithms, and is the slowest step for some of them. The classical method to detect a 2-join takes $O(n^3m)$ time where $n$ is the number of vertices of the input graph and $m$ the number of its edges. To detect \\emph{non-path} 2-joins (special kinds of 2-joins that are needed in all of the known algorithms that use 2-joins), the"},"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":"1107.3977","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-07-20T13:40:23Z","cross_cats_sorted":[],"title_canon_sha256":"f08a2c948645a08f7ad9b2fa3cbe77e11f01817d942fc2581bf552bdbb0bd9f7","abstract_canon_sha256":"870d8291bcd9cb75ceef3b955a14d07183bd33c4d0db42b922600d8f5fc24326"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:25.375330Z","signature_b64":"1wer6DY3aFyKy8yvlcUL80UD7xa/1rPv/2I6klQOCuCvId1d2gDTW2NEX4Mv7oYfQ6yGE6Tv8PqLUm/I0poODg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"185bebb94be3cf35871050302479178521bb1e7902e5fccfaf61c8cebfb1b2f8","last_reissued_at":"2026-05-18T01:09:25.374778Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:25.374778Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Detecting 2-joins faster","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Kristina Vu\\v{s}kovi\\'c, Michel Habib, Nicolas Trotignon, Pierre Charbit","submitted_at":"2011-07-20T13:40:23Z","abstract_excerpt":"2-joins are edge cutsets that naturally appear in the decomposition of several classes of graphs closed under taking induced subgraphs, such as balanced bipartite graphs, even-hole-free graphs, perfect graphs and claw-free graphs. Their detection is needed in several algorithms, and is the slowest step for some of them. The classical method to detect a 2-join takes $O(n^3m)$ time where $n$ is the number of vertices of the input graph and $m$ the number of its edges. To detect \\emph{non-path} 2-joins (special kinds of 2-joins that are needed in all of the known algorithms that use 2-joins), the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.3977","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1107.3977","created_at":"2026-05-18T01:09:25.374862+00:00"},{"alias_kind":"arxiv_version","alias_value":"1107.3977v2","created_at":"2026-05-18T01:09:25.374862+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.3977","created_at":"2026-05-18T01:09:25.374862+00:00"},{"alias_kind":"pith_short_12","alias_value":"DBN6XOKL4PHT","created_at":"2026-05-18T12:26:26.731475+00:00"},{"alias_kind":"pith_short_16","alias_value":"DBN6XOKL4PHTLBYQ","created_at":"2026-05-18T12:26:26.731475+00:00"},{"alias_kind":"pith_short_8","alias_value":"DBN6XOKL","created_at":"2026-05-18T12:26:26.731475+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/DBN6XOKL4PHTLBYQKAYCI6IXQU","json":"https://pith.science/pith/DBN6XOKL4PHTLBYQKAYCI6IXQU.json","graph_json":"https://pith.science/api/pith-number/DBN6XOKL4PHTLBYQKAYCI6IXQU/graph.json","events_json":"https://pith.science/api/pith-number/DBN6XOKL4PHTLBYQKAYCI6IXQU/events.json","paper":"https://pith.science/paper/DBN6XOKL"},"agent_actions":{"view_html":"https://pith.science/pith/DBN6XOKL4PHTLBYQKAYCI6IXQU","download_json":"https://pith.science/pith/DBN6XOKL4PHTLBYQKAYCI6IXQU.json","view_paper":"https://pith.science/paper/DBN6XOKL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1107.3977&json=true","fetch_graph":"https://pith.science/api/pith-number/DBN6XOKL4PHTLBYQKAYCI6IXQU/graph.json","fetch_events":"https://pith.science/api/pith-number/DBN6XOKL4PHTLBYQKAYCI6IXQU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DBN6XOKL4PHTLBYQKAYCI6IXQU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DBN6XOKL4PHTLBYQKAYCI6IXQU/action/storage_attestation","attest_author":"https://pith.science/pith/DBN6XOKL4PHTLBYQKAYCI6IXQU/action/author_attestation","sign_citation":"https://pith.science/pith/DBN6XOKL4PHTLBYQKAYCI6IXQU/action/citation_signature","submit_replication":"https://pith.science/pith/DBN6XOKL4PHTLBYQKAYCI6IXQU/action/replication_record"}},"created_at":"2026-05-18T01:09:25.374862+00:00","updated_at":"2026-05-18T01:09:25.374862+00:00"}