{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:VBTQ6R35F3HKWTSTFRAHAKIT7M","short_pith_number":"pith:VBTQ6R35","schema_version":"1.0","canonical_sha256":"a8670f477d2eceab4e532c40702913fb333fecf1bd5a80ba3214c6475a60c099","source":{"kind":"arxiv","id":"1206.3135","version":1},"attestation_state":"computed","paper":{"title":"Tournament Minors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Ilhee Kim, Paul Seymour","submitted_at":"2012-06-14T15:17:25Z","abstract_excerpt":"We say a digraph $G$ is a {\\em minor} of a digraph $H$ if $G$ can be obtained from a subdigraph of $H$ by repeatedly contracting a strongly-connected subdigraph to a vertex. Here, we show the class of all tournaments is a well-quasi-order under minor containment."},"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":"1206.3135","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-06-14T15:17:25Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"6503f267a7c5c3c2dc00b6600f80661c848eb1d402a870e3c007b0098839bda7","abstract_canon_sha256":"58bec044b4538e51d768832a21be6b20fffa5619364b82122dbbaff52a89ad02"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:53:32.594298Z","signature_b64":"/ckNaDMFxLPbq0JzfsQpvjWQKldP05S5lc66gPuKNhQeHmcPu70lsVGwkldVi4fbeq5Zl7VxMj3ZRIQVvOBoDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a8670f477d2eceab4e532c40702913fb333fecf1bd5a80ba3214c6475a60c099","last_reissued_at":"2026-05-18T03:53:32.593712Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:53:32.593712Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tournament Minors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Ilhee Kim, Paul Seymour","submitted_at":"2012-06-14T15:17:25Z","abstract_excerpt":"We say a digraph $G$ is a {\\em minor} of a digraph $H$ if $G$ can be obtained from a subdigraph of $H$ by repeatedly contracting a strongly-connected subdigraph to a vertex. Here, we show the class of all tournaments is a well-quasi-order under minor containment."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.3135","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":"1206.3135","created_at":"2026-05-18T03:53:32.593814+00:00"},{"alias_kind":"arxiv_version","alias_value":"1206.3135v1","created_at":"2026-05-18T03:53:32.593814+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.3135","created_at":"2026-05-18T03:53:32.593814+00:00"},{"alias_kind":"pith_short_12","alias_value":"VBTQ6R35F3HK","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_16","alias_value":"VBTQ6R35F3HKWTST","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_8","alias_value":"VBTQ6R35","created_at":"2026-05-18T12:27:25.539911+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/VBTQ6R35F3HKWTSTFRAHAKIT7M","json":"https://pith.science/pith/VBTQ6R35F3HKWTSTFRAHAKIT7M.json","graph_json":"https://pith.science/api/pith-number/VBTQ6R35F3HKWTSTFRAHAKIT7M/graph.json","events_json":"https://pith.science/api/pith-number/VBTQ6R35F3HKWTSTFRAHAKIT7M/events.json","paper":"https://pith.science/paper/VBTQ6R35"},"agent_actions":{"view_html":"https://pith.science/pith/VBTQ6R35F3HKWTSTFRAHAKIT7M","download_json":"https://pith.science/pith/VBTQ6R35F3HKWTSTFRAHAKIT7M.json","view_paper":"https://pith.science/paper/VBTQ6R35","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1206.3135&json=true","fetch_graph":"https://pith.science/api/pith-number/VBTQ6R35F3HKWTSTFRAHAKIT7M/graph.json","fetch_events":"https://pith.science/api/pith-number/VBTQ6R35F3HKWTSTFRAHAKIT7M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VBTQ6R35F3HKWTSTFRAHAKIT7M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VBTQ6R35F3HKWTSTFRAHAKIT7M/action/storage_attestation","attest_author":"https://pith.science/pith/VBTQ6R35F3HKWTSTFRAHAKIT7M/action/author_attestation","sign_citation":"https://pith.science/pith/VBTQ6R35F3HKWTSTFRAHAKIT7M/action/citation_signature","submit_replication":"https://pith.science/pith/VBTQ6R35F3HKWTSTFRAHAKIT7M/action/replication_record"}},"created_at":"2026-05-18T03:53:32.593814+00:00","updated_at":"2026-05-18T03:53:32.593814+00:00"}