{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:ASR4HRN65KOMJ4RXOPNA6VX5BT","short_pith_number":"pith:ASR4HRN6","canonical_record":{"source":{"id":"1309.0680","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-03T13:54:25Z","cross_cats_sorted":[],"title_canon_sha256":"035f03a6dad926a0dd004126c4e0b5c8a51f5c78fbf2c46135cebcc07df822e3","abstract_canon_sha256":"879579735afd7169ef4fabd3a92a52d44fa6f909ff042769ca6a64cc1f7068a5"},"schema_version":"1.0"},"canonical_sha256":"04a3c3c5beea9cc4f23773da0f56fd0cf4d4f27cc72509f1408d39d866946784","source":{"kind":"arxiv","id":"1309.0680","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.0680","created_at":"2026-05-18T03:14:18Z"},{"alias_kind":"arxiv_version","alias_value":"1309.0680v1","created_at":"2026-05-18T03:14:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.0680","created_at":"2026-05-18T03:14:18Z"},{"alias_kind":"pith_short_12","alias_value":"ASR4HRN65KOM","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"ASR4HRN65KOMJ4RX","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"ASR4HRN6","created_at":"2026-05-18T12:27:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:ASR4HRN65KOMJ4RXOPNA6VX5BT","target":"record","payload":{"canonical_record":{"source":{"id":"1309.0680","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-03T13:54:25Z","cross_cats_sorted":[],"title_canon_sha256":"035f03a6dad926a0dd004126c4e0b5c8a51f5c78fbf2c46135cebcc07df822e3","abstract_canon_sha256":"879579735afd7169ef4fabd3a92a52d44fa6f909ff042769ca6a64cc1f7068a5"},"schema_version":"1.0"},"canonical_sha256":"04a3c3c5beea9cc4f23773da0f56fd0cf4d4f27cc72509f1408d39d866946784","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:14:18.378067Z","signature_b64":"+UfPOHecyMWBYg82NAo34CE/SuNFbAH72PieQ06cXExMi73SVKElo7WBE381hnEp0cupxUaNZwOLpP9M86WZDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"04a3c3c5beea9cc4f23773da0f56fd0cf4d4f27cc72509f1408d39d866946784","last_reissued_at":"2026-05-18T03:14:18.377432Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:14:18.377432Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1309.0680","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:14:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DpaG3BOxspGftZ8U4/ZU3tTC2+Pv0uKRoJohb3x7TMGe40MCCFuY6vUhhlTZxRyGntttlRDqs8xZZ43QyRneCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T19:29:29.569112Z"},"content_sha256":"d0e35c7072300e6399a0b8ef50f2e16cdebb8f3b52bc879663898119d9261a76","schema_version":"1.0","event_id":"sha256:d0e35c7072300e6399a0b8ef50f2e16cdebb8f3b52bc879663898119d9261a76"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:ASR4HRN65KOMJ4RXOPNA6VX5BT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Decomposing Berge graphs and detecting balanced skew partitions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Nicolas Trotignon","submitted_at":"2013-09-03T13:54:25Z","abstract_excerpt":"A hole in a graph is an induced cycle on at least four vertices. A graph is Berge if it has no odd hole and if its complement has no odd hole. In 2002, Chudnovsky, Robertson, Seymour and Thomas proved a decomposition theorem for Berge graphs saying that every Berge graph either is in a well understood basic class, or has some kind of decomposition. Then, Chudnovsky proved stronger theorems. One of them restricts the allowed decompositions to 2-joins and balanced skew partitions.\n  We prove that the problem of deciding whether a graph has a balanced skew partition is NP-hard. We give an $O(n^9)"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.0680","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:14:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VnTCXEeySOrfYGLIRZ8sS6sPNE3u5PvrdAlejA9sY1o+37Ih8zeGvMvm495je1YtLaC9yvci9R6c61CG9Tv/Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T19:29:29.569476Z"},"content_sha256":"d4e8301945231f58bd585b8178cd5106058909b2bc151d384cfd78de924bb333","schema_version":"1.0","event_id":"sha256:d4e8301945231f58bd585b8178cd5106058909b2bc151d384cfd78de924bb333"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ASR4HRN65KOMJ4RXOPNA6VX5BT/bundle.json","state_url":"https://pith.science/pith/ASR4HRN65KOMJ4RXOPNA6VX5BT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ASR4HRN65KOMJ4RXOPNA6VX5BT/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-07-04T19:29:29Z","links":{"resolver":"https://pith.science/pith/ASR4HRN65KOMJ4RXOPNA6VX5BT","bundle":"https://pith.science/pith/ASR4HRN65KOMJ4RXOPNA6VX5BT/bundle.json","state":"https://pith.science/pith/ASR4HRN65KOMJ4RXOPNA6VX5BT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ASR4HRN65KOMJ4RXOPNA6VX5BT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:ASR4HRN65KOMJ4RXOPNA6VX5BT","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":"879579735afd7169ef4fabd3a92a52d44fa6f909ff042769ca6a64cc1f7068a5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-03T13:54:25Z","title_canon_sha256":"035f03a6dad926a0dd004126c4e0b5c8a51f5c78fbf2c46135cebcc07df822e3"},"schema_version":"1.0","source":{"id":"1309.0680","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.0680","created_at":"2026-05-18T03:14:18Z"},{"alias_kind":"arxiv_version","alias_value":"1309.0680v1","created_at":"2026-05-18T03:14:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.0680","created_at":"2026-05-18T03:14:18Z"},{"alias_kind":"pith_short_12","alias_value":"ASR4HRN65KOM","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"ASR4HRN65KOMJ4RX","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"ASR4HRN6","created_at":"2026-05-18T12:27:38Z"}],"graph_snapshots":[{"event_id":"sha256:d4e8301945231f58bd585b8178cd5106058909b2bc151d384cfd78de924bb333","target":"graph","created_at":"2026-05-18T03:14:18Z","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 hole in a graph is an induced cycle on at least four vertices. A graph is Berge if it has no odd hole and if its complement has no odd hole. In 2002, Chudnovsky, Robertson, Seymour and Thomas proved a decomposition theorem for Berge graphs saying that every Berge graph either is in a well understood basic class, or has some kind of decomposition. Then, Chudnovsky proved stronger theorems. One of them restricts the allowed decompositions to 2-joins and balanced skew partitions.\n  We prove that the problem of deciding whether a graph has a balanced skew partition is NP-hard. We give an $O(n^9)","authors_text":"Nicolas Trotignon","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-03T13:54:25Z","title":"Decomposing Berge graphs and detecting balanced skew partitions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.0680","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:d0e35c7072300e6399a0b8ef50f2e16cdebb8f3b52bc879663898119d9261a76","target":"record","created_at":"2026-05-18T03:14:18Z","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":"879579735afd7169ef4fabd3a92a52d44fa6f909ff042769ca6a64cc1f7068a5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-03T13:54:25Z","title_canon_sha256":"035f03a6dad926a0dd004126c4e0b5c8a51f5c78fbf2c46135cebcc07df822e3"},"schema_version":"1.0","source":{"id":"1309.0680","kind":"arxiv","version":1}},"canonical_sha256":"04a3c3c5beea9cc4f23773da0f56fd0cf4d4f27cc72509f1408d39d866946784","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"04a3c3c5beea9cc4f23773da0f56fd0cf4d4f27cc72509f1408d39d866946784","first_computed_at":"2026-05-18T03:14:18.377432Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:14:18.377432Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+UfPOHecyMWBYg82NAo34CE/SuNFbAH72PieQ06cXExMi73SVKElo7WBE381hnEp0cupxUaNZwOLpP9M86WZDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:14:18.378067Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.0680","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d0e35c7072300e6399a0b8ef50f2e16cdebb8f3b52bc879663898119d9261a76","sha256:d4e8301945231f58bd585b8178cd5106058909b2bc151d384cfd78de924bb333"],"state_sha256":"33e6be80db0cacfeaa407c536d9b30c7bb6d6406d7c195765e0acf283e5f36d9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W0Qi5yQn5wwZDnwDqhR9sREUgIhV98iNphTmPd6OqAjXL8DaogM4XA8ZaVQ2C6Hom6lvjgRtUYbTUGXIkH3dCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-04T19:29:29.571422Z","bundle_sha256":"d077a2737b7205ce9272f561228dfe99f30a604b47dfb8af9602fc0851025dac"}}