{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:JQQ3AMWDELKICDFEDDK26DPP35","short_pith_number":"pith:JQQ3AMWD","schema_version":"1.0","canonical_sha256":"4c21b032c322d4810ca418d5af0defdf553046a784306efb450dc09326c81542","source":{"kind":"arxiv","id":"1309.1547","version":1},"attestation_state":"computed","paper":{"title":"Combinatorial optimization with 2-joins","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Kristina Vu\\v{s}kovi\\'c, Nicolas Trotignon","submitted_at":"2013-09-06T06:45:29Z","abstract_excerpt":"A 2-join is an edge cutset that naturally appears in decomposition of several classes of graphs closed under taking induced subgraphs, such as perfect graphs and claw-free graphs. In this paper we construct combinatorial polynomial time algorithms for finding a maximum weighted clique, a maximum weighted stable set and an optimal coloring for a class of perfect graphs decomposable by 2-joins: the class of perfect graphs that do not have a balanced skew partition, a 2-join in the complement, nor a homogeneous pair. The techniques we develop are general enough to be easily applied to finding a m"},"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":"1309.1547","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-09-06T06:45:29Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"6065c1d5ed39b866bb8e6443d53e5b9e840590a1eb86076add540260f2e948d7","abstract_canon_sha256":"1945aa45a31010f368aeb057b4531b3f5e974f30eed3f68531dff2b84cdeb613"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:18:19.633756Z","signature_b64":"N0ELic7pbKzxenjzLOYcBfsdGH//WZArNFWEztbkqb0xry4mnUQcfHtj/N/New/PY/HIBnOW6GlqBCM5VVIvAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4c21b032c322d4810ca418d5af0defdf553046a784306efb450dc09326c81542","last_reissued_at":"2026-05-18T01:18:19.633161Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:18:19.633161Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Combinatorial optimization with 2-joins","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Kristina Vu\\v{s}kovi\\'c, Nicolas Trotignon","submitted_at":"2013-09-06T06:45:29Z","abstract_excerpt":"A 2-join is an edge cutset that naturally appears in decomposition of several classes of graphs closed under taking induced subgraphs, such as perfect graphs and claw-free graphs. In this paper we construct combinatorial polynomial time algorithms for finding a maximum weighted clique, a maximum weighted stable set and an optimal coloring for a class of perfect graphs decomposable by 2-joins: the class of perfect graphs that do not have a balanced skew partition, a 2-join in the complement, nor a homogeneous pair. The techniques we develop are general enough to be easily applied to finding a m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.1547","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":"1309.1547","created_at":"2026-05-18T01:18:19.633254+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.1547v1","created_at":"2026-05-18T01:18:19.633254+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.1547","created_at":"2026-05-18T01:18:19.633254+00:00"},{"alias_kind":"pith_short_12","alias_value":"JQQ3AMWDELKI","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_16","alias_value":"JQQ3AMWDELKICDFE","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_8","alias_value":"JQQ3AMWD","created_at":"2026-05-18T12:27:49.015174+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/JQQ3AMWDELKICDFEDDK26DPP35","json":"https://pith.science/pith/JQQ3AMWDELKICDFEDDK26DPP35.json","graph_json":"https://pith.science/api/pith-number/JQQ3AMWDELKICDFEDDK26DPP35/graph.json","events_json":"https://pith.science/api/pith-number/JQQ3AMWDELKICDFEDDK26DPP35/events.json","paper":"https://pith.science/paper/JQQ3AMWD"},"agent_actions":{"view_html":"https://pith.science/pith/JQQ3AMWDELKICDFEDDK26DPP35","download_json":"https://pith.science/pith/JQQ3AMWDELKICDFEDDK26DPP35.json","view_paper":"https://pith.science/paper/JQQ3AMWD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.1547&json=true","fetch_graph":"https://pith.science/api/pith-number/JQQ3AMWDELKICDFEDDK26DPP35/graph.json","fetch_events":"https://pith.science/api/pith-number/JQQ3AMWDELKICDFEDDK26DPP35/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JQQ3AMWDELKICDFEDDK26DPP35/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JQQ3AMWDELKICDFEDDK26DPP35/action/storage_attestation","attest_author":"https://pith.science/pith/JQQ3AMWDELKICDFEDDK26DPP35/action/author_attestation","sign_citation":"https://pith.science/pith/JQQ3AMWDELKICDFEDDK26DPP35/action/citation_signature","submit_replication":"https://pith.science/pith/JQQ3AMWDELKICDFEDDK26DPP35/action/replication_record"}},"created_at":"2026-05-18T01:18:19.633254+00:00","updated_at":"2026-05-18T01:18:19.633254+00:00"}