{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:JERHC22ZV54QVMLYSTVPVXSDYC","short_pith_number":"pith:JERHC22Z","canonical_record":{"source":{"id":"2605.22846","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2026-05-15T08:50:44Z","cross_cats_sorted":["econ.TH","math.CO"],"title_canon_sha256":"aefc49727eff5e07f69abe473cec945b1cd6309e71be3763ddb5bcfd9e24f24a","abstract_canon_sha256":"a8bcca7a69d50592d7abffb00945ea33ea4654d82e2aa651030cace446ba55b4"},"schema_version":"1.0"},"canonical_sha256":"4922716b59af790ab17894eafade43c0a96a151c26f5a6374dfd2399d9c01071","source":{"kind":"arxiv","id":"2605.22846","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.22846","created_at":"2026-05-25T00:00:58Z"},{"alias_kind":"arxiv_version","alias_value":"2605.22846v1","created_at":"2026-05-25T00:00:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.22846","created_at":"2026-05-25T00:00:58Z"},{"alias_kind":"pith_short_12","alias_value":"JERHC22ZV54Q","created_at":"2026-05-25T00:00:58Z"},{"alias_kind":"pith_short_16","alias_value":"JERHC22ZV54QVMLY","created_at":"2026-05-25T00:00:58Z"},{"alias_kind":"pith_short_8","alias_value":"JERHC22Z","created_at":"2026-05-25T00:00:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:JERHC22ZV54QVMLYSTVPVXSDYC","target":"record","payload":{"canonical_record":{"source":{"id":"2605.22846","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2026-05-15T08:50:44Z","cross_cats_sorted":["econ.TH","math.CO"],"title_canon_sha256":"aefc49727eff5e07f69abe473cec945b1cd6309e71be3763ddb5bcfd9e24f24a","abstract_canon_sha256":"a8bcca7a69d50592d7abffb00945ea33ea4654d82e2aa651030cace446ba55b4"},"schema_version":"1.0"},"canonical_sha256":"4922716b59af790ab17894eafade43c0a96a151c26f5a6374dfd2399d9c01071","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-25T00:00:58.955696Z","signature_b64":"HiPg+siWoBATK8Na8DUHx5ZcBUgJd5mxoOLN+w70NE4+11rzViLiE6N2xqm/0hSzr+MiS6JpRYm9kPZDKy4aAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4922716b59af790ab17894eafade43c0a96a151c26f5a6374dfd2399d9c01071","last_reissued_at":"2026-05-25T00:00:58.954542Z","signature_status":"signed_v1","first_computed_at":"2026-05-25T00:00:58.954542Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.22846","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-25T00:00:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EiyQjCoxit697lZz7kObNw9JxDS2WwRpS84VeN38AnTxkt7HRwWs+T4/3WTcvQITiLSUKetC/wEAWdngtDBIBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T16:16:44.965278Z"},"content_sha256":"c1f017e73214e31b31ac24d0ea56d544d2dce9d4674119ce235d678bae476c77","schema_version":"1.0","event_id":"sha256:c1f017e73214e31b31ac24d0ea56d544d2dce9d4674119ce235d678bae476c77"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:JERHC22ZV54QVMLYSTVPVXSDYC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Axiomatic Theory of Tie-Breaking: Impossibility, Characterization, and Decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["econ.TH","math.CO"],"primary_cat":"cs.GT","authors_text":"Frank M. V. Feys","submitted_at":"2026-05-15T08:50:44Z","abstract_excerpt":"We develop an abstract axiomatic theory of tie-breaking. A tie-breaking input consists of a finite set N of players, a weak order on N representing the standings to be refined, and an auxiliary information item drawn from a set on which the symmetric group Sym(N) acts. Within this minimal framework we prove three theorems. First, no tie-breaking rule producing a strict linear order can be anonymous, provided the input space contains even one intrinsically symmetric situation, a condition met in essentially every realistic application. Second, when we allow the rule to output a partition of N ("},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.22846","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/2605.22846/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-05-25T00:00:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NahoC1xlujw84Pf3m2ud6sJ2idS4FzdTqTMcvCKGQJcXeEBLOZEiis0lcT5r0P7+1z8SkztYSEeI1sEF00y9AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T16:16:44.966128Z"},"content_sha256":"a618199b7b9c51f526f5a96b0f576a36a61ea8b3148b866c91f29a2508206a32","schema_version":"1.0","event_id":"sha256:a618199b7b9c51f526f5a96b0f576a36a61ea8b3148b866c91f29a2508206a32"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JERHC22ZV54QVMLYSTVPVXSDYC/bundle.json","state_url":"https://pith.science/pith/JERHC22ZV54QVMLYSTVPVXSDYC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JERHC22ZV54QVMLYSTVPVXSDYC/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-10T16:16:44Z","links":{"resolver":"https://pith.science/pith/JERHC22ZV54QVMLYSTVPVXSDYC","bundle":"https://pith.science/pith/JERHC22ZV54QVMLYSTVPVXSDYC/bundle.json","state":"https://pith.science/pith/JERHC22ZV54QVMLYSTVPVXSDYC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JERHC22ZV54QVMLYSTVPVXSDYC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:JERHC22ZV54QVMLYSTVPVXSDYC","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":"a8bcca7a69d50592d7abffb00945ea33ea4654d82e2aa651030cace446ba55b4","cross_cats_sorted":["econ.TH","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2026-05-15T08:50:44Z","title_canon_sha256":"aefc49727eff5e07f69abe473cec945b1cd6309e71be3763ddb5bcfd9e24f24a"},"schema_version":"1.0","source":{"id":"2605.22846","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.22846","created_at":"2026-05-25T00:00:58Z"},{"alias_kind":"arxiv_version","alias_value":"2605.22846v1","created_at":"2026-05-25T00:00:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.22846","created_at":"2026-05-25T00:00:58Z"},{"alias_kind":"pith_short_12","alias_value":"JERHC22ZV54Q","created_at":"2026-05-25T00:00:58Z"},{"alias_kind":"pith_short_16","alias_value":"JERHC22ZV54QVMLY","created_at":"2026-05-25T00:00:58Z"},{"alias_kind":"pith_short_8","alias_value":"JERHC22Z","created_at":"2026-05-25T00:00:58Z"}],"graph_snapshots":[{"event_id":"sha256:a618199b7b9c51f526f5a96b0f576a36a61ea8b3148b866c91f29a2508206a32","target":"graph","created_at":"2026-05-25T00:00:58Z","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/2605.22846/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We develop an abstract axiomatic theory of tie-breaking. A tie-breaking input consists of a finite set N of players, a weak order on N representing the standings to be refined, and an auxiliary information item drawn from a set on which the symmetric group Sym(N) acts. Within this minimal framework we prove three theorems. First, no tie-breaking rule producing a strict linear order can be anonymous, provided the input space contains even one intrinsically symmetric situation, a condition met in essentially every realistic application. Second, when we allow the rule to output a partition of N (","authors_text":"Frank M. V. Feys","cross_cats":["econ.TH","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2026-05-15T08:50:44Z","title":"An Axiomatic Theory of Tie-Breaking: Impossibility, Characterization, and Decomposition"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.22846","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:c1f017e73214e31b31ac24d0ea56d544d2dce9d4674119ce235d678bae476c77","target":"record","created_at":"2026-05-25T00:00:58Z","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":"a8bcca7a69d50592d7abffb00945ea33ea4654d82e2aa651030cace446ba55b4","cross_cats_sorted":["econ.TH","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2026-05-15T08:50:44Z","title_canon_sha256":"aefc49727eff5e07f69abe473cec945b1cd6309e71be3763ddb5bcfd9e24f24a"},"schema_version":"1.0","source":{"id":"2605.22846","kind":"arxiv","version":1}},"canonical_sha256":"4922716b59af790ab17894eafade43c0a96a151c26f5a6374dfd2399d9c01071","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4922716b59af790ab17894eafade43c0a96a151c26f5a6374dfd2399d9c01071","first_computed_at":"2026-05-25T00:00:58.954542Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-25T00:00:58.954542Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HiPg+siWoBATK8Na8DUHx5ZcBUgJd5mxoOLN+w70NE4+11rzViLiE6N2xqm/0hSzr+MiS6JpRYm9kPZDKy4aAQ==","signature_status":"signed_v1","signed_at":"2026-05-25T00:00:58.955696Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.22846","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c1f017e73214e31b31ac24d0ea56d544d2dce9d4674119ce235d678bae476c77","sha256:a618199b7b9c51f526f5a96b0f576a36a61ea8b3148b866c91f29a2508206a32"],"state_sha256":"908d37845d1c13243fdc8489387a1d645dd1472bb94ed4a9f35acb72c4b42a99"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6GBqxTeCrMh3N91orwgb7RmOSGyiszljaMdeA3bvBQxSaPJ/R4+H0zEl7UslGIsdIEGiu2TYyGjxwjE+3Ky1DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T16:16:44.970074Z","bundle_sha256":"c173e6a8cdbd77eab5a7b68c28eec9a1a12373fd8eb1099fc47b4fd4143441af"}}