{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:DLDNIUXWSY3C7P7ZFDTWITEZRE","short_pith_number":"pith:DLDNIUXW","canonical_record":{"source":{"id":"1701.06539","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-01-03T17:08:53Z","cross_cats_sorted":[],"title_canon_sha256":"d694db5580733b3048e234037c87e91036c3847cbaddb9a56872fd2073a9725a","abstract_canon_sha256":"6b41abefc6a9234efeb09af5d9ea46e52890b3527abc27f0463d593535bec97f"},"schema_version":"1.0"},"canonical_sha256":"1ac6d452f696362fbff928e7644c9989203d023c6d4b0087a45320c081a10c9a","source":{"kind":"arxiv","id":"1701.06539","version":6},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.06539","created_at":"2026-05-17T23:42:59Z"},{"alias_kind":"arxiv_version","alias_value":"1701.06539v6","created_at":"2026-05-17T23:42:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.06539","created_at":"2026-05-17T23:42:59Z"},{"alias_kind":"pith_short_12","alias_value":"DLDNIUXWSY3C","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"DLDNIUXWSY3C7P7Z","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"DLDNIUXW","created_at":"2026-05-18T12:31:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:DLDNIUXWSY3C7P7ZFDTWITEZRE","target":"record","payload":{"canonical_record":{"source":{"id":"1701.06539","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-01-03T17:08:53Z","cross_cats_sorted":[],"title_canon_sha256":"d694db5580733b3048e234037c87e91036c3847cbaddb9a56872fd2073a9725a","abstract_canon_sha256":"6b41abefc6a9234efeb09af5d9ea46e52890b3527abc27f0463d593535bec97f"},"schema_version":"1.0"},"canonical_sha256":"1ac6d452f696362fbff928e7644c9989203d023c6d4b0087a45320c081a10c9a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:59.228820Z","signature_b64":"3BQDxFPeveHZInWqKhg6ciroVzMrg2Up003iFKcdLNuD0tOAcIC7YeZWHhLK/8CKBVVDB1PzoZFboRZryredAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1ac6d452f696362fbff928e7644c9989203d023c6d4b0087a45320c081a10c9a","last_reissued_at":"2026-05-17T23:42:59.228411Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:59.228411Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.06539","source_version":6,"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:42:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VIcz4TclSqk30ftwSNnOBI2C5kmE0IXcdz5xiWm8jH7E9Pb53lSWTiQVSLY98OQCOxpJMNz+pRdj9z3bVvxHDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T19:17:05.335503Z"},"content_sha256":"57e63f5b828b2e10e59a077143772de86aaf16c570631af8c4a87cf2fb68e062","schema_version":"1.0","event_id":"sha256:57e63f5b828b2e10e59a077143772de86aaf16c570631af8c4a87cf2fb68e062"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:DLDNIUXWSY3C7P7ZFDTWITEZRE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Some impossibilities of ranking in generalized tournaments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"L\\'aszl\\'o Csat\\'o","submitted_at":"2017-01-03T17:08:53Z","abstract_excerpt":"In a generalized tournament, players may have an arbitrary number of matches against each other and the outcome of the games is measured on a cardinal scale with a lower and upper bound. An axiomatic approach is applied to the problem of ranking the competitors. Self-consistency requires assigning the same rank for players with equivalent results, while a player showing an obviously better performance than another should be ranked strictly higher. According to order preservation, if two players have the same pairwise ranking in two tournaments where the same players have played the same number"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.06539","kind":"arxiv","version":6},"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:42:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3vWqMhPnKDIbTm8miRuumWyhBnxlpA/tdTTkFw9ckRM9VYm2QtRt9hmmmt2QopA7csKudln/8TIEiLXHLXyGDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T19:17:05.335854Z"},"content_sha256":"d3dbb30f37b95b2160dba6f7fe3be00c35ee43b5ca81d10b3ac1b86055c18e27","schema_version":"1.0","event_id":"sha256:d3dbb30f37b95b2160dba6f7fe3be00c35ee43b5ca81d10b3ac1b86055c18e27"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DLDNIUXWSY3C7P7ZFDTWITEZRE/bundle.json","state_url":"https://pith.science/pith/DLDNIUXWSY3C7P7ZFDTWITEZRE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DLDNIUXWSY3C7P7ZFDTWITEZRE/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-04T19:17:05Z","links":{"resolver":"https://pith.science/pith/DLDNIUXWSY3C7P7ZFDTWITEZRE","bundle":"https://pith.science/pith/DLDNIUXWSY3C7P7ZFDTWITEZRE/bundle.json","state":"https://pith.science/pith/DLDNIUXWSY3C7P7ZFDTWITEZRE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DLDNIUXWSY3C7P7ZFDTWITEZRE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:DLDNIUXWSY3C7P7ZFDTWITEZRE","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":"6b41abefc6a9234efeb09af5d9ea46e52890b3527abc27f0463d593535bec97f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-01-03T17:08:53Z","title_canon_sha256":"d694db5580733b3048e234037c87e91036c3847cbaddb9a56872fd2073a9725a"},"schema_version":"1.0","source":{"id":"1701.06539","kind":"arxiv","version":6}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.06539","created_at":"2026-05-17T23:42:59Z"},{"alias_kind":"arxiv_version","alias_value":"1701.06539v6","created_at":"2026-05-17T23:42:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.06539","created_at":"2026-05-17T23:42:59Z"},{"alias_kind":"pith_short_12","alias_value":"DLDNIUXWSY3C","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"DLDNIUXWSY3C7P7Z","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"DLDNIUXW","created_at":"2026-05-18T12:31:10Z"}],"graph_snapshots":[{"event_id":"sha256:d3dbb30f37b95b2160dba6f7fe3be00c35ee43b5ca81d10b3ac1b86055c18e27","target":"graph","created_at":"2026-05-17T23:42: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 a generalized tournament, players may have an arbitrary number of matches against each other and the outcome of the games is measured on a cardinal scale with a lower and upper bound. An axiomatic approach is applied to the problem of ranking the competitors. Self-consistency requires assigning the same rank for players with equivalent results, while a player showing an obviously better performance than another should be ranked strictly higher. According to order preservation, if two players have the same pairwise ranking in two tournaments where the same players have played the same number","authors_text":"L\\'aszl\\'o Csat\\'o","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-01-03T17:08:53Z","title":"Some impossibilities of ranking in generalized tournaments"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.06539","kind":"arxiv","version":6},"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:57e63f5b828b2e10e59a077143772de86aaf16c570631af8c4a87cf2fb68e062","target":"record","created_at":"2026-05-17T23:42: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":"6b41abefc6a9234efeb09af5d9ea46e52890b3527abc27f0463d593535bec97f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-01-03T17:08:53Z","title_canon_sha256":"d694db5580733b3048e234037c87e91036c3847cbaddb9a56872fd2073a9725a"},"schema_version":"1.0","source":{"id":"1701.06539","kind":"arxiv","version":6}},"canonical_sha256":"1ac6d452f696362fbff928e7644c9989203d023c6d4b0087a45320c081a10c9a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1ac6d452f696362fbff928e7644c9989203d023c6d4b0087a45320c081a10c9a","first_computed_at":"2026-05-17T23:42:59.228411Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:42:59.228411Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3BQDxFPeveHZInWqKhg6ciroVzMrg2Up003iFKcdLNuD0tOAcIC7YeZWHhLK/8CKBVVDB1PzoZFboRZryredAw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:42:59.228820Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.06539","source_kind":"arxiv","source_version":6}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:57e63f5b828b2e10e59a077143772de86aaf16c570631af8c4a87cf2fb68e062","sha256:d3dbb30f37b95b2160dba6f7fe3be00c35ee43b5ca81d10b3ac1b86055c18e27"],"state_sha256":"78d60fb05a61c6763b131dec418a959e13f0749598d13338b2ffec097eef897c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"60FEESB4rsOajUIjZA5EWE+LgnShlDEOEMXsMu6pZKfr/PDXLlWvUv75bXRSUnKrUU6Jg36+VbZtckaPvJLNAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T19:17:05.337868Z","bundle_sha256":"5f7b439151a33cd00dd20a8ceb90d41e1b01b4fb2630f50d71009097de3c74be"}}