{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:7ZAJ5XQV3RSK2MQQG4HW5TP74R","short_pith_number":"pith:7ZAJ5XQV","canonical_record":{"source":{"id":"1302.0812","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-02-04T19:40:36Z","cross_cats_sorted":[],"title_canon_sha256":"80358aa91d024cbbe8589367dcf5d347e2eec7eb511202a5909f33a5868d8d87","abstract_canon_sha256":"6b785dfadd6f96e9c30dcdf00a4add8c1d5a85a89f9e25b551c5ed52c801d6c4"},"schema_version":"1.0"},"canonical_sha256":"fe409ede15dc64ad3210370f6ecdffe4515c67a37b2c3216fe7ec560af3d613f","source":{"kind":"arxiv","id":"1302.0812","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.0812","created_at":"2026-05-18T03:34:36Z"},{"alias_kind":"arxiv_version","alias_value":"1302.0812v1","created_at":"2026-05-18T03:34:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.0812","created_at":"2026-05-18T03:34:36Z"},{"alias_kind":"pith_short_12","alias_value":"7ZAJ5XQV3RSK","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"7ZAJ5XQV3RSK2MQQ","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"7ZAJ5XQV","created_at":"2026-05-18T12:27:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:7ZAJ5XQV3RSK2MQQG4HW5TP74R","target":"record","payload":{"canonical_record":{"source":{"id":"1302.0812","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-02-04T19:40:36Z","cross_cats_sorted":[],"title_canon_sha256":"80358aa91d024cbbe8589367dcf5d347e2eec7eb511202a5909f33a5868d8d87","abstract_canon_sha256":"6b785dfadd6f96e9c30dcdf00a4add8c1d5a85a89f9e25b551c5ed52c801d6c4"},"schema_version":"1.0"},"canonical_sha256":"fe409ede15dc64ad3210370f6ecdffe4515c67a37b2c3216fe7ec560af3d613f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:34:36.230458Z","signature_b64":"/M1O48M1P+omWMSkwT/qY70Fah+4GmH3MCJ4gKZPPM5a7m5goIXXFOOytR0GI2tv4MWC63qhlcBFTi8uzz6wDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fe409ede15dc64ad3210370f6ecdffe4515c67a37b2c3216fe7ec560af3d613f","last_reissued_at":"2026-05-18T03:34:36.229992Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:34:36.229992Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1302.0812","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:34:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VxBfRQIk841jtr5iwYwB1YSogZjqXaHJcJqnB9DhxEhkhDIwIJQ1qpCUGAOukMiqsVAf4GPjd64BE3AkKcQwDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T08:44:12.201268Z"},"content_sha256":"48c5691b171e0ea28c7b2440510a116165390ce6f80e47552b4aeae8426e4f4f","schema_version":"1.0","event_id":"sha256:48c5691b171e0ea28c7b2440510a116165390ce6f80e47552b4aeae8426e4f4f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:7ZAJ5XQV3RSK2MQQG4HW5TP74R","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Excluding Pairs of Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alex Scott, Maria Chudnovsky, Paul Seymour","submitted_at":"2013-02-04T19:40:36Z","abstract_excerpt":"For a graph $G$ and a set of graphs $\\mathcal{H}$, we say that $G$ is {\\em $\\mathcal{H}$-free} if no induced subgraph of $G$ is isomorphic to a member of $\\mathcal{H}$. Given an integer $P>0$, a graph $G$, and a set of graphs $\\mathcal{F}$, we say that $G$ {\\em admits an $(\\mathcal{F},P)$-partition} if the vertex set of $G$ can be partitioned into $P$ subsets $X_1,..., X_P$, so that for every $i \\in \\{1,..., P\\}$, either $|X_i|=1$, or the subgraph of $G$ induced by $X_i$ is $\\{F\\}$-free for some $F \\in \\mathcal{F}$.\n  Our first result is the following. For every pair $(H,J)$ of graphs such tha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.0812","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:34:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T8T4n2e9oey1Z15TScbpwxTNy5yBY+43fjQ2+RCV2LDj8YyuatIE6pJx92XOe3Aq3yLchA8PPlB6KqAxcFm5Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T08:44:12.201627Z"},"content_sha256":"22767969e4659728501288c34705c97d82bc7988925963d12837d40611f73db6","schema_version":"1.0","event_id":"sha256:22767969e4659728501288c34705c97d82bc7988925963d12837d40611f73db6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7ZAJ5XQV3RSK2MQQG4HW5TP74R/bundle.json","state_url":"https://pith.science/pith/7ZAJ5XQV3RSK2MQQG4HW5TP74R/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7ZAJ5XQV3RSK2MQQG4HW5TP74R/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-28T08:44:12Z","links":{"resolver":"https://pith.science/pith/7ZAJ5XQV3RSK2MQQG4HW5TP74R","bundle":"https://pith.science/pith/7ZAJ5XQV3RSK2MQQG4HW5TP74R/bundle.json","state":"https://pith.science/pith/7ZAJ5XQV3RSK2MQQG4HW5TP74R/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7ZAJ5XQV3RSK2MQQG4HW5TP74R/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:7ZAJ5XQV3RSK2MQQG4HW5TP74R","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":"6b785dfadd6f96e9c30dcdf00a4add8c1d5a85a89f9e25b551c5ed52c801d6c4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-02-04T19:40:36Z","title_canon_sha256":"80358aa91d024cbbe8589367dcf5d347e2eec7eb511202a5909f33a5868d8d87"},"schema_version":"1.0","source":{"id":"1302.0812","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.0812","created_at":"2026-05-18T03:34:36Z"},{"alias_kind":"arxiv_version","alias_value":"1302.0812v1","created_at":"2026-05-18T03:34:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.0812","created_at":"2026-05-18T03:34:36Z"},{"alias_kind":"pith_short_12","alias_value":"7ZAJ5XQV3RSK","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"7ZAJ5XQV3RSK2MQQ","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"7ZAJ5XQV","created_at":"2026-05-18T12:27:38Z"}],"graph_snapshots":[{"event_id":"sha256:22767969e4659728501288c34705c97d82bc7988925963d12837d40611f73db6","target":"graph","created_at":"2026-05-18T03:34:36Z","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":"For a graph $G$ and a set of graphs $\\mathcal{H}$, we say that $G$ is {\\em $\\mathcal{H}$-free} if no induced subgraph of $G$ is isomorphic to a member of $\\mathcal{H}$. Given an integer $P>0$, a graph $G$, and a set of graphs $\\mathcal{F}$, we say that $G$ {\\em admits an $(\\mathcal{F},P)$-partition} if the vertex set of $G$ can be partitioned into $P$ subsets $X_1,..., X_P$, so that for every $i \\in \\{1,..., P\\}$, either $|X_i|=1$, or the subgraph of $G$ induced by $X_i$ is $\\{F\\}$-free for some $F \\in \\mathcal{F}$.\n  Our first result is the following. For every pair $(H,J)$ of graphs such tha","authors_text":"Alex Scott, Maria Chudnovsky, Paul Seymour","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-02-04T19:40:36Z","title":"Excluding Pairs of Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.0812","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:48c5691b171e0ea28c7b2440510a116165390ce6f80e47552b4aeae8426e4f4f","target":"record","created_at":"2026-05-18T03:34:36Z","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":"6b785dfadd6f96e9c30dcdf00a4add8c1d5a85a89f9e25b551c5ed52c801d6c4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-02-04T19:40:36Z","title_canon_sha256":"80358aa91d024cbbe8589367dcf5d347e2eec7eb511202a5909f33a5868d8d87"},"schema_version":"1.0","source":{"id":"1302.0812","kind":"arxiv","version":1}},"canonical_sha256":"fe409ede15dc64ad3210370f6ecdffe4515c67a37b2c3216fe7ec560af3d613f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fe409ede15dc64ad3210370f6ecdffe4515c67a37b2c3216fe7ec560af3d613f","first_computed_at":"2026-05-18T03:34:36.229992Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:34:36.229992Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/M1O48M1P+omWMSkwT/qY70Fah+4GmH3MCJ4gKZPPM5a7m5goIXXFOOytR0GI2tv4MWC63qhlcBFTi8uzz6wDA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:34:36.230458Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.0812","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:48c5691b171e0ea28c7b2440510a116165390ce6f80e47552b4aeae8426e4f4f","sha256:22767969e4659728501288c34705c97d82bc7988925963d12837d40611f73db6"],"state_sha256":"05cc9136a7d9841f1cf6a3108edde01a359900ed3aa72d4b303fa7820f671eff"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"voUD35yJgKzXElX+ajINYmpDPAzQLtxKtha5OhxGIi6Hj+fY6veVLTj/8kCmi8KvoZ2rWJSvjIBkXmRNo8A9Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T08:44:12.203672Z","bundle_sha256":"d70a9d7831d688c5386012c649aadf58017d1564b141560d682753c7327a9fe0"}}