{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:QQ4OGTAZOQMVSWSVUUAI4QHAXN","short_pith_number":"pith:QQ4OGTAZ","canonical_record":{"source":{"id":"1903.07476","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-18T14:34:35Z","cross_cats_sorted":["cs.DM","math.GR"],"title_canon_sha256":"bf3586a0941d6e5d5bd621dc7f22fd9c5f0f4c029015b67f2611113e7951f108","abstract_canon_sha256":"28530ff1c2aa79dfd3be3b51c149cb6733f64b1248203d09a939e681e1cbebe3"},"schema_version":"1.0"},"canonical_sha256":"8438e34c197419595a55a5008e40e0bb488294b87b389cc7df12e805a4cb7c76","source":{"kind":"arxiv","id":"1903.07476","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.07476","created_at":"2026-05-17T23:51:01Z"},{"alias_kind":"arxiv_version","alias_value":"1903.07476v1","created_at":"2026-05-17T23:51:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.07476","created_at":"2026-05-17T23:51:01Z"},{"alias_kind":"pith_short_12","alias_value":"QQ4OGTAZOQMV","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"QQ4OGTAZOQMVSWSV","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"QQ4OGTAZ","created_at":"2026-05-18T12:33:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:QQ4OGTAZOQMVSWSVUUAI4QHAXN","target":"record","payload":{"canonical_record":{"source":{"id":"1903.07476","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-18T14:34:35Z","cross_cats_sorted":["cs.DM","math.GR"],"title_canon_sha256":"bf3586a0941d6e5d5bd621dc7f22fd9c5f0f4c029015b67f2611113e7951f108","abstract_canon_sha256":"28530ff1c2aa79dfd3be3b51c149cb6733f64b1248203d09a939e681e1cbebe3"},"schema_version":"1.0"},"canonical_sha256":"8438e34c197419595a55a5008e40e0bb488294b87b389cc7df12e805a4cb7c76","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:01.315532Z","signature_b64":"2y7T4BN5E7YC+PhUNa7fyWd9ouvcFjRsXOf3AvtNAEQEfAg9G3QSpoIwJwInBGgZCoM0XaSf5x3OhmXIibstBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8438e34c197419595a55a5008e40e0bb488294b87b389cc7df12e805a4cb7c76","last_reissued_at":"2026-05-17T23:51:01.315024Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:01.315024Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.07476","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-17T23:51:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ARm+vb2e+r/17xZuwarJzi6UApdegR5Cl/LFTXiOsE++Tc7RMtgohjXMjVJZ2OFHc4BywPkFR66Fh7GsQvo/AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T12:57:12.693529Z"},"content_sha256":"1979f79ccecc5c5e149bef32d97f936172a00d6be82f38c382616bb8b83f353a","schema_version":"1.0","event_id":"sha256:1979f79ccecc5c5e149bef32d97f936172a00d6be82f38c382616bb8b83f353a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:QQ4OGTAZOQMVSWSVUUAI4QHAXN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Extending partial automorphisms of $n$-partite tournaments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.GR"],"primary_cat":"math.CO","authors_text":"Colin Jahel, Jan Hubi\\v{c}ka, Marcin Sabok, Mat\\v{e}j Kone\\v{c}n\\'y","submitted_at":"2019-03-18T14:34:35Z","abstract_excerpt":"We prove that for every $n\\geq 2$ the class of all finite $n$-partite tournaments (orientations of complete $n$-partite graphs) has the extension property for partial automorphisms, that is, for every finite $n$-partite tournament $G$ there is a finite $n$-partite tournament $H$ such that every isomorphism of induced subgraphs of $G$ extends to an automorphism of $H$. Our constructions are purely combinatorial (whereas many earlier EPPA results use deep results from group theory) and extend to other classes such as the class of all finite semi-generic tournaments."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.07476","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-17T23:51:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"962+Rwax2YYo+CE0Chh9A15n4xSu8W9yl83gABJmFvLhvRSXdVo+x6UyyItR1vmFNH4Rl9UnAxzGBlpcYfFPCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T12:57:12.694837Z"},"content_sha256":"10cdb04b0e8991fade48a0d338e797bbe45d45c490965dbac8e0aeba31c22eed","schema_version":"1.0","event_id":"sha256:10cdb04b0e8991fade48a0d338e797bbe45d45c490965dbac8e0aeba31c22eed"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QQ4OGTAZOQMVSWSVUUAI4QHAXN/bundle.json","state_url":"https://pith.science/pith/QQ4OGTAZOQMVSWSVUUAI4QHAXN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QQ4OGTAZOQMVSWSVUUAI4QHAXN/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-27T12:57:12Z","links":{"resolver":"https://pith.science/pith/QQ4OGTAZOQMVSWSVUUAI4QHAXN","bundle":"https://pith.science/pith/QQ4OGTAZOQMVSWSVUUAI4QHAXN/bundle.json","state":"https://pith.science/pith/QQ4OGTAZOQMVSWSVUUAI4QHAXN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QQ4OGTAZOQMVSWSVUUAI4QHAXN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:QQ4OGTAZOQMVSWSVUUAI4QHAXN","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":"28530ff1c2aa79dfd3be3b51c149cb6733f64b1248203d09a939e681e1cbebe3","cross_cats_sorted":["cs.DM","math.GR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-18T14:34:35Z","title_canon_sha256":"bf3586a0941d6e5d5bd621dc7f22fd9c5f0f4c029015b67f2611113e7951f108"},"schema_version":"1.0","source":{"id":"1903.07476","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.07476","created_at":"2026-05-17T23:51:01Z"},{"alias_kind":"arxiv_version","alias_value":"1903.07476v1","created_at":"2026-05-17T23:51:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.07476","created_at":"2026-05-17T23:51:01Z"},{"alias_kind":"pith_short_12","alias_value":"QQ4OGTAZOQMV","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"QQ4OGTAZOQMVSWSV","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"QQ4OGTAZ","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:10cdb04b0e8991fade48a0d338e797bbe45d45c490965dbac8e0aeba31c22eed","target":"graph","created_at":"2026-05-17T23:51:01Z","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":"We prove that for every $n\\geq 2$ the class of all finite $n$-partite tournaments (orientations of complete $n$-partite graphs) has the extension property for partial automorphisms, that is, for every finite $n$-partite tournament $G$ there is a finite $n$-partite tournament $H$ such that every isomorphism of induced subgraphs of $G$ extends to an automorphism of $H$. Our constructions are purely combinatorial (whereas many earlier EPPA results use deep results from group theory) and extend to other classes such as the class of all finite semi-generic tournaments.","authors_text":"Colin Jahel, Jan Hubi\\v{c}ka, Marcin Sabok, Mat\\v{e}j Kone\\v{c}n\\'y","cross_cats":["cs.DM","math.GR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-18T14:34:35Z","title":"Extending partial automorphisms of $n$-partite tournaments"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.07476","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:1979f79ccecc5c5e149bef32d97f936172a00d6be82f38c382616bb8b83f353a","target":"record","created_at":"2026-05-17T23:51:01Z","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":"28530ff1c2aa79dfd3be3b51c149cb6733f64b1248203d09a939e681e1cbebe3","cross_cats_sorted":["cs.DM","math.GR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-18T14:34:35Z","title_canon_sha256":"bf3586a0941d6e5d5bd621dc7f22fd9c5f0f4c029015b67f2611113e7951f108"},"schema_version":"1.0","source":{"id":"1903.07476","kind":"arxiv","version":1}},"canonical_sha256":"8438e34c197419595a55a5008e40e0bb488294b87b389cc7df12e805a4cb7c76","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8438e34c197419595a55a5008e40e0bb488294b87b389cc7df12e805a4cb7c76","first_computed_at":"2026-05-17T23:51:01.315024Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:51:01.315024Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2y7T4BN5E7YC+PhUNa7fyWd9ouvcFjRsXOf3AvtNAEQEfAg9G3QSpoIwJwInBGgZCoM0XaSf5x3OhmXIibstBw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:51:01.315532Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.07476","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1979f79ccecc5c5e149bef32d97f936172a00d6be82f38c382616bb8b83f353a","sha256:10cdb04b0e8991fade48a0d338e797bbe45d45c490965dbac8e0aeba31c22eed"],"state_sha256":"e15f8cdbdf3dcd04a9a05b4fb8eb2897a8c0a31c966be04f78102c09f3cedbb0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QiP5NWBCrkC6MoijL6Q6k0CFSDyA61w7bmW3Jn0lkNEPjd4wn/91JjHEhy5grjQpUpYP8KIkYKQD2AhRa+wSAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T12:57:12.698810Z","bundle_sha256":"848a33f38d7dca723176365bd59f251fe1ed99ed77b355f6f9455991d07deb77"}}