{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:VQEMYVFGDPFDFWCWKZZGUYKGMQ","short_pith_number":"pith:VQEMYVFG","canonical_record":{"source":{"id":"1207.0237","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-07-01T19:11:42Z","cross_cats_sorted":[],"title_canon_sha256":"bfd9b1e5dce6e8c7ef0e165ccfae83fa77f655bcae86e44cc0ed4fd9c7237273","abstract_canon_sha256":"bf92ad90aacf32c4369293d70e918f56bed30abdc0496879c24a5f36ea3f480f"},"schema_version":"1.0"},"canonical_sha256":"ac08cc54a61bca32d85656726a6146643deacb45077d40c720b536a6aa35dbfc","source":{"kind":"arxiv","id":"1207.0237","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.0237","created_at":"2026-05-18T03:51:59Z"},{"alias_kind":"arxiv_version","alias_value":"1207.0237v1","created_at":"2026-05-18T03:51:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.0237","created_at":"2026-05-18T03:51:59Z"},{"alias_kind":"pith_short_12","alias_value":"VQEMYVFGDPFD","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"VQEMYVFGDPFDFWCW","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"VQEMYVFG","created_at":"2026-05-18T12:27:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:VQEMYVFGDPFDFWCWKZZGUYKGMQ","target":"record","payload":{"canonical_record":{"source":{"id":"1207.0237","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-07-01T19:11:42Z","cross_cats_sorted":[],"title_canon_sha256":"bfd9b1e5dce6e8c7ef0e165ccfae83fa77f655bcae86e44cc0ed4fd9c7237273","abstract_canon_sha256":"bf92ad90aacf32c4369293d70e918f56bed30abdc0496879c24a5f36ea3f480f"},"schema_version":"1.0"},"canonical_sha256":"ac08cc54a61bca32d85656726a6146643deacb45077d40c720b536a6aa35dbfc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:51:59.822601Z","signature_b64":"XYsu+N/P527XLUjH2uclBSQGmn8O/bkDAPjxO6439WWgPwlTNPcAF7zBz2jLQfgs6ruWKYZl0RQFt3Sw0NDHAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ac08cc54a61bca32d85656726a6146643deacb45077d40c720b536a6aa35dbfc","last_reissued_at":"2026-05-18T03:51:59.821951Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:51:59.821951Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1207.0237","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:51:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vZHflPEWJ7o1ZXp37PZG/mj6UG1Rwh1nxJUh0mUcEPJP3qBvHXhX/EbrNFjadzgADkVFSzQTKKZ+yaG6GWA8Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T09:01:32.804130Z"},"content_sha256":"7c4471f4a919f8ee31b3e7d451168561d2b4c18585994061698999aabeb820d8","schema_version":"1.0","event_id":"sha256:7c4471f4a919f8ee31b3e7d451168561d2b4c18585994061698999aabeb820d8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:VQEMYVFGDPFDFWCWKZZGUYKGMQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Various Theorems on Tournaments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Gaku Liu","submitted_at":"2012-07-01T19:11:42Z","abstract_excerpt":"In this thesis we prove a variety of theorems on tournaments. A \\emph{prime} tournament is a tournament $G$ such that there is no $X \\subseteq V(G)$, $1 < |X| < |V(G)|$, such that for every vertex $v \\in V(G) \\minus X$, either $v \\ra x$ for all $x \\in X$ or $x \\ra v$ for all $x \\in X$. First, we prove that given a prime tournament $G$ which is not in one of three special families of tournaments, for any prime subtournament $H$ of $G$ with $5 \\le |V(H)| < |V(G)|$ there exists a prime subtournament of $G$ with $|V(H)| + 1$ vertices that has a subtournament isomorphic to $H$. We next prove that f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.0237","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:51:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Kudd26c4AHpeVNQ61ePLjwdYFLmfgQPlPRfszCsk5a3gQR1lzq8FyVcLLqZq41DSWvJI042VPfv2bRnS4LQMBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T09:01:32.804496Z"},"content_sha256":"4ab91f5f88495d9c2ce4aa40f0a5f14051ccbec95b85c84667e2bf535397a123","schema_version":"1.0","event_id":"sha256:4ab91f5f88495d9c2ce4aa40f0a5f14051ccbec95b85c84667e2bf535397a123"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VQEMYVFGDPFDFWCWKZZGUYKGMQ/bundle.json","state_url":"https://pith.science/pith/VQEMYVFGDPFDFWCWKZZGUYKGMQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VQEMYVFGDPFDFWCWKZZGUYKGMQ/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-21T09:01:32Z","links":{"resolver":"https://pith.science/pith/VQEMYVFGDPFDFWCWKZZGUYKGMQ","bundle":"https://pith.science/pith/VQEMYVFGDPFDFWCWKZZGUYKGMQ/bundle.json","state":"https://pith.science/pith/VQEMYVFGDPFDFWCWKZZGUYKGMQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VQEMYVFGDPFDFWCWKZZGUYKGMQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:VQEMYVFGDPFDFWCWKZZGUYKGMQ","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":"bf92ad90aacf32c4369293d70e918f56bed30abdc0496879c24a5f36ea3f480f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-07-01T19:11:42Z","title_canon_sha256":"bfd9b1e5dce6e8c7ef0e165ccfae83fa77f655bcae86e44cc0ed4fd9c7237273"},"schema_version":"1.0","source":{"id":"1207.0237","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.0237","created_at":"2026-05-18T03:51:59Z"},{"alias_kind":"arxiv_version","alias_value":"1207.0237v1","created_at":"2026-05-18T03:51:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.0237","created_at":"2026-05-18T03:51:59Z"},{"alias_kind":"pith_short_12","alias_value":"VQEMYVFGDPFD","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"VQEMYVFGDPFDFWCW","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"VQEMYVFG","created_at":"2026-05-18T12:27:25Z"}],"graph_snapshots":[{"event_id":"sha256:4ab91f5f88495d9c2ce4aa40f0a5f14051ccbec95b85c84667e2bf535397a123","target":"graph","created_at":"2026-05-18T03:51:59Z","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":"In this thesis we prove a variety of theorems on tournaments. A \\emph{prime} tournament is a tournament $G$ such that there is no $X \\subseteq V(G)$, $1 < |X| < |V(G)|$, such that for every vertex $v \\in V(G) \\minus X$, either $v \\ra x$ for all $x \\in X$ or $x \\ra v$ for all $x \\in X$. First, we prove that given a prime tournament $G$ which is not in one of three special families of tournaments, for any prime subtournament $H$ of $G$ with $5 \\le |V(H)| < |V(G)|$ there exists a prime subtournament of $G$ with $|V(H)| + 1$ vertices that has a subtournament isomorphic to $H$. We next prove that f","authors_text":"Gaku Liu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-07-01T19:11:42Z","title":"Various Theorems on Tournaments"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.0237","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:7c4471f4a919f8ee31b3e7d451168561d2b4c18585994061698999aabeb820d8","target":"record","created_at":"2026-05-18T03:51:59Z","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":"bf92ad90aacf32c4369293d70e918f56bed30abdc0496879c24a5f36ea3f480f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-07-01T19:11:42Z","title_canon_sha256":"bfd9b1e5dce6e8c7ef0e165ccfae83fa77f655bcae86e44cc0ed4fd9c7237273"},"schema_version":"1.0","source":{"id":"1207.0237","kind":"arxiv","version":1}},"canonical_sha256":"ac08cc54a61bca32d85656726a6146643deacb45077d40c720b536a6aa35dbfc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ac08cc54a61bca32d85656726a6146643deacb45077d40c720b536a6aa35dbfc","first_computed_at":"2026-05-18T03:51:59.821951Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:51:59.821951Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XYsu+N/P527XLUjH2uclBSQGmn8O/bkDAPjxO6439WWgPwlTNPcAF7zBz2jLQfgs6ruWKYZl0RQFt3Sw0NDHAA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:51:59.822601Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.0237","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7c4471f4a919f8ee31b3e7d451168561d2b4c18585994061698999aabeb820d8","sha256:4ab91f5f88495d9c2ce4aa40f0a5f14051ccbec95b85c84667e2bf535397a123"],"state_sha256":"6c3d0c4ff91790bb99fbeb2da0871581dcce35f340f5267354ece5e93f06141c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sSIzVLSl2hSVJD3h8oZ/1Ybs6dZOW3bLONz5CjlpDGY3q0JRau5sQMzxM7ru86B1Vd7AoyGmja8NToSMNr0bAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T09:01:32.806621Z","bundle_sha256":"342cfd72551f99aa49acb62574c2fc0f1fd464b1a18099af593cddcf90839b05"}}