{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:AA6NRLO2B2CA4RVEZJXCI65EAD","short_pith_number":"pith:AA6NRLO2","canonical_record":{"source":{"id":"2506.03701","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2025-06-04T08:34:24Z","cross_cats_sorted":[],"title_canon_sha256":"974729ce11cff21f1a2c7e6b2a81716c48e2be59b330f045d8c85841ab951b29","abstract_canon_sha256":"fb7d24b236e198054ca19e0f5f6cf40c280932fda3a306799b9b9972c671c3e6"},"schema_version":"1.0"},"canonical_sha256":"003cd8adda0e840e46a4ca6e247ba400f9eab4f772519cfd8328070c7be626cd","source":{"kind":"arxiv","id":"2506.03701","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.03701","created_at":"2026-07-05T11:15:50Z"},{"alias_kind":"arxiv_version","alias_value":"2506.03701v1","created_at":"2026-07-05T11:15:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.03701","created_at":"2026-07-05T11:15:50Z"},{"alias_kind":"pith_short_12","alias_value":"AA6NRLO2B2CA","created_at":"2026-07-05T11:15:50Z"},{"alias_kind":"pith_short_16","alias_value":"AA6NRLO2B2CA4RVE","created_at":"2026-07-05T11:15:50Z"},{"alias_kind":"pith_short_8","alias_value":"AA6NRLO2","created_at":"2026-07-05T11:15:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:AA6NRLO2B2CA4RVEZJXCI65EAD","target":"record","payload":{"canonical_record":{"source":{"id":"2506.03701","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2025-06-04T08:34:24Z","cross_cats_sorted":[],"title_canon_sha256":"974729ce11cff21f1a2c7e6b2a81716c48e2be59b330f045d8c85841ab951b29","abstract_canon_sha256":"fb7d24b236e198054ca19e0f5f6cf40c280932fda3a306799b9b9972c671c3e6"},"schema_version":"1.0"},"canonical_sha256":"003cd8adda0e840e46a4ca6e247ba400f9eab4f772519cfd8328070c7be626cd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:15:50.225855Z","signature_b64":"gV2qxOs3k1zUC9LYa7Gm5VIJO7nxw4pOsxPHnzYeqfkSkdrGHv3G+gD1sHwGmWd4iNej3SK1ijyOLy9C/VAXBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"003cd8adda0e840e46a4ca6e247ba400f9eab4f772519cfd8328070c7be626cd","last_reissued_at":"2026-07-05T11:15:50.225439Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:15:50.225439Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2506.03701","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-07-05T11:15:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kigMcHNZ5WjVOpzZlhoWDkesMy+TINkiJAR/RWMZjf7MngMhqxJOgQxqgmxuKg/z0XHdA21j5xM+tuGzmVkrDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T02:06:53.380756Z"},"content_sha256":"8fa9bd999c73453afd7bc0acc1887b86ac40ed412ad876978636818260dfcf98","schema_version":"1.0","event_id":"sha256:8fa9bd999c73453afd7bc0acc1887b86ac40ed412ad876978636818260dfcf98"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:AA6NRLO2B2CA4RVEZJXCI65EAD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tournament Robustness via Redundancy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Hendrik Molter, Klim Efremenko, Meirav Zehavi","submitted_at":"2025-06-04T08:34:24Z","abstract_excerpt":"A knockout tournament is one of the most simple and popular forms of competition. Here, we are given a binary tournament tree where all leaves are labeled with seed position names. The players participating in the tournament are assigned to the seed positions. In each round, the two players assigned to leaves of the tournament tree with a common parent compete, and the winner is promoted to the parent. The last remaining player is the winner of the tournament.\n  In this work, we study the problem of making knock-out tournaments robust against manipulation, where the form of manipulation we con"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.03701","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2506.03701/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T11:15:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pgvSm0oXVQduc2sWYLIDJ6/cES2R8d2OKOqF1HKl7UCxE4MoOrDiVcitQa0JG5ZwxUD8advDO0chVEJzidzoBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T02:06:53.381338Z"},"content_sha256":"5de04b4dba1c2201b9e74df71ecebbf2b341447226097b06a318f0e7fd8bc0b4","schema_version":"1.0","event_id":"sha256:5de04b4dba1c2201b9e74df71ecebbf2b341447226097b06a318f0e7fd8bc0b4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AA6NRLO2B2CA4RVEZJXCI65EAD/bundle.json","state_url":"https://pith.science/pith/AA6NRLO2B2CA4RVEZJXCI65EAD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AA6NRLO2B2CA4RVEZJXCI65EAD/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-08-08T02:06:53Z","links":{"resolver":"https://pith.science/pith/AA6NRLO2B2CA4RVEZJXCI65EAD","bundle":"https://pith.science/pith/AA6NRLO2B2CA4RVEZJXCI65EAD/bundle.json","state":"https://pith.science/pith/AA6NRLO2B2CA4RVEZJXCI65EAD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AA6NRLO2B2CA4RVEZJXCI65EAD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:AA6NRLO2B2CA4RVEZJXCI65EAD","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":"fb7d24b236e198054ca19e0f5f6cf40c280932fda3a306799b9b9972c671c3e6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2025-06-04T08:34:24Z","title_canon_sha256":"974729ce11cff21f1a2c7e6b2a81716c48e2be59b330f045d8c85841ab951b29"},"schema_version":"1.0","source":{"id":"2506.03701","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.03701","created_at":"2026-07-05T11:15:50Z"},{"alias_kind":"arxiv_version","alias_value":"2506.03701v1","created_at":"2026-07-05T11:15:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.03701","created_at":"2026-07-05T11:15:50Z"},{"alias_kind":"pith_short_12","alias_value":"AA6NRLO2B2CA","created_at":"2026-07-05T11:15:50Z"},{"alias_kind":"pith_short_16","alias_value":"AA6NRLO2B2CA4RVE","created_at":"2026-07-05T11:15:50Z"},{"alias_kind":"pith_short_8","alias_value":"AA6NRLO2","created_at":"2026-07-05T11:15:50Z"}],"graph_snapshots":[{"event_id":"sha256:5de04b4dba1c2201b9e74df71ecebbf2b341447226097b06a318f0e7fd8bc0b4","target":"graph","created_at":"2026-07-05T11:15:50Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2506.03701/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A knockout tournament is one of the most simple and popular forms of competition. Here, we are given a binary tournament tree where all leaves are labeled with seed position names. The players participating in the tournament are assigned to the seed positions. In each round, the two players assigned to leaves of the tournament tree with a common parent compete, and the winner is promoted to the parent. The last remaining player is the winner of the tournament.\n  In this work, we study the problem of making knock-out tournaments robust against manipulation, where the form of manipulation we con","authors_text":"Hendrik Molter, Klim Efremenko, Meirav Zehavi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2025-06-04T08:34:24Z","title":"Tournament Robustness via Redundancy"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.03701","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:8fa9bd999c73453afd7bc0acc1887b86ac40ed412ad876978636818260dfcf98","target":"record","created_at":"2026-07-05T11:15:50Z","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":"fb7d24b236e198054ca19e0f5f6cf40c280932fda3a306799b9b9972c671c3e6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2025-06-04T08:34:24Z","title_canon_sha256":"974729ce11cff21f1a2c7e6b2a81716c48e2be59b330f045d8c85841ab951b29"},"schema_version":"1.0","source":{"id":"2506.03701","kind":"arxiv","version":1}},"canonical_sha256":"003cd8adda0e840e46a4ca6e247ba400f9eab4f772519cfd8328070c7be626cd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"003cd8adda0e840e46a4ca6e247ba400f9eab4f772519cfd8328070c7be626cd","first_computed_at":"2026-07-05T11:15:50.225439Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:15:50.225439Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gV2qxOs3k1zUC9LYa7Gm5VIJO7nxw4pOsxPHnzYeqfkSkdrGHv3G+gD1sHwGmWd4iNej3SK1ijyOLy9C/VAXBw==","signature_status":"signed_v1","signed_at":"2026-07-05T11:15:50.225855Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.03701","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8fa9bd999c73453afd7bc0acc1887b86ac40ed412ad876978636818260dfcf98","sha256:5de04b4dba1c2201b9e74df71ecebbf2b341447226097b06a318f0e7fd8bc0b4"],"state_sha256":"ee6896d4f75e8520de292423d4e6b258b927b20b5366e4172ceceacd9f614078"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bOJ7pCpgk2SPyR94r5AjimqJZ0r12y56TTXfcSibl2723E3yF+byCgBGir8a9bhXrYPHs/SiojTWhPim7pHTAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T02:06:53.385086Z","bundle_sha256":"d6ced3b66e39c3544f1f170d9b9f21a0c556d3088d7d699f218a8b1a9d7c166d"}}