{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:VRQJ2PFXYCFMVK47FZYACSCDEK","short_pith_number":"pith:VRQJ2PFX","canonical_record":{"source":{"id":"1208.0398","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-08-02T04:37:19Z","cross_cats_sorted":[],"title_canon_sha256":"22dae2176012796696dcaafe62bd87666dea52966d339b4aa0318bf2f537bfd7","abstract_canon_sha256":"3cd51d39ff7320c6e277bfbe4c80d266244863ae054aabc20b8e864756f0b988"},"schema_version":"1.0"},"canonical_sha256":"ac609d3cb7c08acaab9f2e7001484322bca9d4a0190ffb8fd606245d77081de0","source":{"kind":"arxiv","id":"1208.0398","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.0398","created_at":"2026-05-18T02:49:03Z"},{"alias_kind":"arxiv_version","alias_value":"1208.0398v2","created_at":"2026-05-18T02:49:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.0398","created_at":"2026-05-18T02:49:03Z"},{"alias_kind":"pith_short_12","alias_value":"VRQJ2PFXYCFM","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"VRQJ2PFXYCFMVK47","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"VRQJ2PFX","created_at":"2026-05-18T12:27:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:VRQJ2PFXYCFMVK47FZYACSCDEK","target":"record","payload":{"canonical_record":{"source":{"id":"1208.0398","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-08-02T04:37:19Z","cross_cats_sorted":[],"title_canon_sha256":"22dae2176012796696dcaafe62bd87666dea52966d339b4aa0318bf2f537bfd7","abstract_canon_sha256":"3cd51d39ff7320c6e277bfbe4c80d266244863ae054aabc20b8e864756f0b988"},"schema_version":"1.0"},"canonical_sha256":"ac609d3cb7c08acaab9f2e7001484322bca9d4a0190ffb8fd606245d77081de0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:49:03.446134Z","signature_b64":"MP73aUGiJ8oT8zQav/a4MEkF4hVvUo7lfmTCSi//ek3x+M/DakA33P2xAIf5ZftWQRaB/x3q55yySjixIdcvDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ac609d3cb7c08acaab9f2e7001484322bca9d4a0190ffb8fd606245d77081de0","last_reissued_at":"2026-05-18T02:49:03.445692Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:49:03.445692Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1208.0398","source_version":2,"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-18T02:49:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9Y3wgjKrp9s8XKdRKzC+UjWA+wQqeQwiSIO0+EIjAmQZrfTnX2JGLINao1xvREZBzsU9MhxnfH5NTInd9D+lCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T12:57:48.576678Z"},"content_sha256":"f9666ecba810dadf935a419bc30bf794396c3ea3d0e5d18dde4bdc057bacec36","schema_version":"1.0","event_id":"sha256:f9666ecba810dadf935a419bc30bf794396c3ea3d0e5d18dde4bdc057bacec36"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:VRQJ2PFXYCFMVK47FZYACSCDEK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Structure theorem for U5-free tournaments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Gaku Liu","submitted_at":"2012-08-02T04:37:19Z","abstract_excerpt":"Let $U_5$ be the tournament with vertices $v_1$, ..., $v_5$ such that $v_2 \\rightarrow v_1$, and $v_i \\rightarrow v_j$ if $j-i \\equiv 1$, $2 \\pmod{5}$ and ${i,j} \\neq {1,2}$. In this paper we describe the tournaments which do not have $U_5$ as a subtournament. Specifically, we show that if a tournament $G$ is \"prime\"---that is, if there is no subset $X \\subseteq V(G)$, $1 < |X| < |V(G)|$, such that for all $v \\in V(G) \\backslash X$, either $v \\rightarrow x$ for all $x \\in X$ or $x \\rightarrow v$ for all $x \\in X$---then $G$ is $U_5$-free if and only if either $G$ is a specific tournament $T_n$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.0398","kind":"arxiv","version":2},"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-18T02:49:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+K6c48vrsTP6GX7jj2A4TIF8VJRIbdSfgftctcCoA9uy4W38/vogxk0T3Ig1cWVtamH+XgMKUvoPkWc1SDkDCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T12:57:48.577031Z"},"content_sha256":"97bbc45c101f77eea48e07b25201c7247c4ffda9921c6dea3c462c204db85be8","schema_version":"1.0","event_id":"sha256:97bbc45c101f77eea48e07b25201c7247c4ffda9921c6dea3c462c204db85be8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VRQJ2PFXYCFMVK47FZYACSCDEK/bundle.json","state_url":"https://pith.science/pith/VRQJ2PFXYCFMVK47FZYACSCDEK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VRQJ2PFXYCFMVK47FZYACSCDEK/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-06-21T12:57:48Z","links":{"resolver":"https://pith.science/pith/VRQJ2PFXYCFMVK47FZYACSCDEK","bundle":"https://pith.science/pith/VRQJ2PFXYCFMVK47FZYACSCDEK/bundle.json","state":"https://pith.science/pith/VRQJ2PFXYCFMVK47FZYACSCDEK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VRQJ2PFXYCFMVK47FZYACSCDEK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:VRQJ2PFXYCFMVK47FZYACSCDEK","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":"3cd51d39ff7320c6e277bfbe4c80d266244863ae054aabc20b8e864756f0b988","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-08-02T04:37:19Z","title_canon_sha256":"22dae2176012796696dcaafe62bd87666dea52966d339b4aa0318bf2f537bfd7"},"schema_version":"1.0","source":{"id":"1208.0398","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.0398","created_at":"2026-05-18T02:49:03Z"},{"alias_kind":"arxiv_version","alias_value":"1208.0398v2","created_at":"2026-05-18T02:49:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.0398","created_at":"2026-05-18T02:49:03Z"},{"alias_kind":"pith_short_12","alias_value":"VRQJ2PFXYCFM","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"VRQJ2PFXYCFMVK47","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"VRQJ2PFX","created_at":"2026-05-18T12:27:25Z"}],"graph_snapshots":[{"event_id":"sha256:97bbc45c101f77eea48e07b25201c7247c4ffda9921c6dea3c462c204db85be8","target":"graph","created_at":"2026-05-18T02:49:03Z","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":"Let $U_5$ be the tournament with vertices $v_1$, ..., $v_5$ such that $v_2 \\rightarrow v_1$, and $v_i \\rightarrow v_j$ if $j-i \\equiv 1$, $2 \\pmod{5}$ and ${i,j} \\neq {1,2}$. In this paper we describe the tournaments which do not have $U_5$ as a subtournament. Specifically, we show that if a tournament $G$ is \"prime\"---that is, if there is no subset $X \\subseteq V(G)$, $1 < |X| < |V(G)|$, such that for all $v \\in V(G) \\backslash X$, either $v \\rightarrow x$ for all $x \\in X$ or $x \\rightarrow v$ for all $x \\in X$---then $G$ is $U_5$-free if and only if either $G$ is a specific tournament $T_n$","authors_text":"Gaku Liu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-08-02T04:37:19Z","title":"Structure theorem for U5-free tournaments"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.0398","kind":"arxiv","version":2},"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:f9666ecba810dadf935a419bc30bf794396c3ea3d0e5d18dde4bdc057bacec36","target":"record","created_at":"2026-05-18T02:49:03Z","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":"3cd51d39ff7320c6e277bfbe4c80d266244863ae054aabc20b8e864756f0b988","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-08-02T04:37:19Z","title_canon_sha256":"22dae2176012796696dcaafe62bd87666dea52966d339b4aa0318bf2f537bfd7"},"schema_version":"1.0","source":{"id":"1208.0398","kind":"arxiv","version":2}},"canonical_sha256":"ac609d3cb7c08acaab9f2e7001484322bca9d4a0190ffb8fd606245d77081de0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ac609d3cb7c08acaab9f2e7001484322bca9d4a0190ffb8fd606245d77081de0","first_computed_at":"2026-05-18T02:49:03.445692Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:49:03.445692Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MP73aUGiJ8oT8zQav/a4MEkF4hVvUo7lfmTCSi//ek3x+M/DakA33P2xAIf5ZftWQRaB/x3q55yySjixIdcvDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:49:03.446134Z","signed_message":"canonical_sha256_bytes"},"source_id":"1208.0398","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f9666ecba810dadf935a419bc30bf794396c3ea3d0e5d18dde4bdc057bacec36","sha256:97bbc45c101f77eea48e07b25201c7247c4ffda9921c6dea3c462c204db85be8"],"state_sha256":"4bb599005ebef5cbe88a4fb0f654c320935ffe7671a9f6d5bc4cd446b410db06"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S2cTOWbrXdsS+mg5GQDQt72pakPUH9VSV14zDzfcojiPOdczpPYEXksSnsdq4CGqx9zP5bblSmhkBcgd4q1BAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T12:57:48.579066Z","bundle_sha256":"ea2f10a0f30d3fd28dcc7cd91961d0120580187f479539a8886bfe38b2c881d2"}}