{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:JQQ3AMWDELKICDFEDDK26DPP35","short_pith_number":"pith:JQQ3AMWD","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"},"canonical_sha256":"4c21b032c322d4810ca418d5af0defdf553046a784306efb450dc09326c81542","source":{"kind":"arxiv","id":"1309.1547","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.1547","created_at":"2026-05-18T01:18:19Z"},{"alias_kind":"arxiv_version","alias_value":"1309.1547v1","created_at":"2026-05-18T01:18:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.1547","created_at":"2026-05-18T01:18:19Z"},{"alias_kind":"pith_short_12","alias_value":"JQQ3AMWDELKI","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"JQQ3AMWDELKICDFE","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"JQQ3AMWD","created_at":"2026-05-18T12:27:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:JQQ3AMWDELKICDFEDDK26DPP35","target":"record","payload":{"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"},"canonical_sha256":"4c21b032c322d4810ca418d5af0defdf553046a784306efb450dc09326c81542","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"},"source_kind":"arxiv","source_id":"1309.1547","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-18T01:18:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0mBxzH7zlXEon8gpLrv4CeDiMjtaLv2d4erSCN9iPwMSjspmDWfgvChjakHCfJDev9m/e1wnK6CBD0/P+YRIDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:48:39.727083Z"},"content_sha256":"6df266ed8dabe24b27f22281515f758b0a95812b4dcb523c1bc4f11f06bc2587","schema_version":"1.0","event_id":"sha256:6df266ed8dabe24b27f22281515f758b0a95812b4dcb523c1bc4f11f06bc2587"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:JQQ3AMWDELKICDFEDDK26DPP35","target":"graph","payload":{"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"},"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-18T01:18:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5+B9gkjnZq+R/23hz7d8ClX+EXY2rvitYJSOZecXRqWQGTy1R8Sb4yvymehbmJp7jVPTwTANRherhrLQDdRjDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:48:39.727764Z"},"content_sha256":"2ece4f5fe3c15a3498294e9bc36b83b9dc100cbceb32eeb39eb6ebbe12cf897b","schema_version":"1.0","event_id":"sha256:2ece4f5fe3c15a3498294e9bc36b83b9dc100cbceb32eeb39eb6ebbe12cf897b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JQQ3AMWDELKICDFEDDK26DPP35/bundle.json","state_url":"https://pith.science/pith/JQQ3AMWDELKICDFEDDK26DPP35/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JQQ3AMWDELKICDFEDDK26DPP35/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-05-25T19:48:39Z","links":{"resolver":"https://pith.science/pith/JQQ3AMWDELKICDFEDDK26DPP35","bundle":"https://pith.science/pith/JQQ3AMWDELKICDFEDDK26DPP35/bundle.json","state":"https://pith.science/pith/JQQ3AMWDELKICDFEDDK26DPP35/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JQQ3AMWDELKICDFEDDK26DPP35/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:JQQ3AMWDELKICDFEDDK26DPP35","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":"1945aa45a31010f368aeb057b4531b3f5e974f30eed3f68531dff2b84cdeb613","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-09-06T06:45:29Z","title_canon_sha256":"6065c1d5ed39b866bb8e6443d53e5b9e840590a1eb86076add540260f2e948d7"},"schema_version":"1.0","source":{"id":"1309.1547","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.1547","created_at":"2026-05-18T01:18:19Z"},{"alias_kind":"arxiv_version","alias_value":"1309.1547v1","created_at":"2026-05-18T01:18:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.1547","created_at":"2026-05-18T01:18:19Z"},{"alias_kind":"pith_short_12","alias_value":"JQQ3AMWDELKI","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"JQQ3AMWDELKICDFE","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"JQQ3AMWD","created_at":"2026-05-18T12:27:49Z"}],"graph_snapshots":[{"event_id":"sha256:2ece4f5fe3c15a3498294e9bc36b83b9dc100cbceb32eeb39eb6ebbe12cf897b","target":"graph","created_at":"2026-05-18T01:18:19Z","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":"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","authors_text":"Kristina Vu\\v{s}kovi\\'c, Nicolas Trotignon","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-09-06T06:45:29Z","title":"Combinatorial optimization with 2-joins"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.1547","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:6df266ed8dabe24b27f22281515f758b0a95812b4dcb523c1bc4f11f06bc2587","target":"record","created_at":"2026-05-18T01:18:19Z","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":"1945aa45a31010f368aeb057b4531b3f5e974f30eed3f68531dff2b84cdeb613","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-09-06T06:45:29Z","title_canon_sha256":"6065c1d5ed39b866bb8e6443d53e5b9e840590a1eb86076add540260f2e948d7"},"schema_version":"1.0","source":{"id":"1309.1547","kind":"arxiv","version":1}},"canonical_sha256":"4c21b032c322d4810ca418d5af0defdf553046a784306efb450dc09326c81542","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4c21b032c322d4810ca418d5af0defdf553046a784306efb450dc09326c81542","first_computed_at":"2026-05-18T01:18:19.633161Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:18:19.633161Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"N0ELic7pbKzxenjzLOYcBfsdGH//WZArNFWEztbkqb0xry4mnUQcfHtj/N/New/PY/HIBnOW6GlqBCM5VVIvAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:18:19.633756Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.1547","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6df266ed8dabe24b27f22281515f758b0a95812b4dcb523c1bc4f11f06bc2587","sha256:2ece4f5fe3c15a3498294e9bc36b83b9dc100cbceb32eeb39eb6ebbe12cf897b"],"state_sha256":"7a19c7f2c4d88df8e9c38d16cbbe9d951e406154be4214bb56f1946b5d87bfe0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9XwT1c/P404idWuDTBEO1SRIhOYwxq9S8qIXRJKyvViF63m2k7580V+yJx/a6dLohDfdiBTLRHQRBXTffOoQBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T19:48:39.731825Z","bundle_sha256":"d85deeced1b1adcbffe9940c99a02c423f568994e4b7325c231ca286c81da140"}}