{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:ETKOT56RX2UPQCIQTYQBEOMNIV","short_pith_number":"pith:ETKOT56R","canonical_record":{"source":{"id":"1202.0241","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-01T18:45:51Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"087f31fac3a86494f9ac914e992da96427b7c543fe6dbc0a8457757e0406e438","abstract_canon_sha256":"63ed261cb4b788e9c443b1360d80303ff12f800774c3d9bab79c8f60d90e4c5d"},"schema_version":"1.0"},"canonical_sha256":"24d4e9f7d1bea8f809109e2012398d4557e94d250c68b0547f32b76a1764753e","source":{"kind":"arxiv","id":"1202.0241","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.0241","created_at":"2026-05-18T03:54:14Z"},{"alias_kind":"arxiv_version","alias_value":"1202.0241v3","created_at":"2026-05-18T03:54:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.0241","created_at":"2026-05-18T03:54:14Z"},{"alias_kind":"pith_short_12","alias_value":"ETKOT56RX2UP","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"ETKOT56RX2UPQCIQ","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"ETKOT56R","created_at":"2026-05-18T12:27:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:ETKOT56RX2UPQCIQTYQBEOMNIV","target":"record","payload":{"canonical_record":{"source":{"id":"1202.0241","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-01T18:45:51Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"087f31fac3a86494f9ac914e992da96427b7c543fe6dbc0a8457757e0406e438","abstract_canon_sha256":"63ed261cb4b788e9c443b1360d80303ff12f800774c3d9bab79c8f60d90e4c5d"},"schema_version":"1.0"},"canonical_sha256":"24d4e9f7d1bea8f809109e2012398d4557e94d250c68b0547f32b76a1764753e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:54:14.907540Z","signature_b64":"4THSp6mPf9CPhe4DTksB/zCqUH8KGvoONSZBbgJCq50Z8RgjzH7ZeDRwUlUBvH0eXwXldDp0/ulTqV9cMqIcBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"24d4e9f7d1bea8f809109e2012398d4557e94d250c68b0547f32b76a1764753e","last_reissued_at":"2026-05-18T03:54:14.907086Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:54:14.907086Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1202.0241","source_version":3,"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:54:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N+19mvw0BFoVyZTBE9NDHhrOJxu8P3Kje1EOsv3qkTBXC4Ml4s9jVUblIVw6LHT+knHr15VBfkjKo6k/bnwXAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T12:41:43.350706Z"},"content_sha256":"ebe725776e6eb253dc43fa639c008a2b220d704268f9d16a22809cb0416a58af","schema_version":"1.0","event_id":"sha256:ebe725776e6eb253dc43fa639c008a2b220d704268f9d16a22809cb0416a58af"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:ETKOT56RX2UPQCIQTYQBEOMNIV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Linear Programming Upper Bounds on Permutation Code Sizes From Coherent Configurations Related to the Kendall Tau Distance Metric","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Fabian Lim, Manabu Hagiwara","submitted_at":"2012-02-01T18:45:51Z","abstract_excerpt":"Recent interest on permutation rank modulation shows the Kendall tau metric as an important distance metric. This note documents our first efforts to obtain upper bounds on optimal code sizes (for said metric) ala Delsarte's approach. For the Hamming metric, Delsarte's seminal work on powerful linear programming (LP) bounds have been extended to permutation codes, via association scheme theory. For the Kendall tau metric, the same extension needs the more general theory of coherent configurations, whereby the optimal code size problem can be formulated as an extremely huge semidefinite program"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.0241","kind":"arxiv","version":3},"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:54:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rAivDdIrZImA8BkPAA4Y++ZMQVMVHCRDgzPA8K6RcE9A3mcxJEg6yiL5OO6EuP98aquM3LLVYGpMugsIU1ZfBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T12:41:43.351045Z"},"content_sha256":"7ff8086870695580fdc5424277096396a357f8efee4292ff6b124ed709f87eb2","schema_version":"1.0","event_id":"sha256:7ff8086870695580fdc5424277096396a357f8efee4292ff6b124ed709f87eb2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ETKOT56RX2UPQCIQTYQBEOMNIV/bundle.json","state_url":"https://pith.science/pith/ETKOT56RX2UPQCIQTYQBEOMNIV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ETKOT56RX2UPQCIQTYQBEOMNIV/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-08T12:41:43Z","links":{"resolver":"https://pith.science/pith/ETKOT56RX2UPQCIQTYQBEOMNIV","bundle":"https://pith.science/pith/ETKOT56RX2UPQCIQTYQBEOMNIV/bundle.json","state":"https://pith.science/pith/ETKOT56RX2UPQCIQTYQBEOMNIV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ETKOT56RX2UPQCIQTYQBEOMNIV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:ETKOT56RX2UPQCIQTYQBEOMNIV","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":"63ed261cb4b788e9c443b1360d80303ff12f800774c3d9bab79c8f60d90e4c5d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-01T18:45:51Z","title_canon_sha256":"087f31fac3a86494f9ac914e992da96427b7c543fe6dbc0a8457757e0406e438"},"schema_version":"1.0","source":{"id":"1202.0241","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.0241","created_at":"2026-05-18T03:54:14Z"},{"alias_kind":"arxiv_version","alias_value":"1202.0241v3","created_at":"2026-05-18T03:54:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.0241","created_at":"2026-05-18T03:54:14Z"},{"alias_kind":"pith_short_12","alias_value":"ETKOT56RX2UP","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"ETKOT56RX2UPQCIQ","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"ETKOT56R","created_at":"2026-05-18T12:27:04Z"}],"graph_snapshots":[{"event_id":"sha256:7ff8086870695580fdc5424277096396a357f8efee4292ff6b124ed709f87eb2","target":"graph","created_at":"2026-05-18T03:54:14Z","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":"Recent interest on permutation rank modulation shows the Kendall tau metric as an important distance metric. This note documents our first efforts to obtain upper bounds on optimal code sizes (for said metric) ala Delsarte's approach. For the Hamming metric, Delsarte's seminal work on powerful linear programming (LP) bounds have been extended to permutation codes, via association scheme theory. For the Kendall tau metric, the same extension needs the more general theory of coherent configurations, whereby the optimal code size problem can be formulated as an extremely huge semidefinite program","authors_text":"Fabian Lim, Manabu Hagiwara","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-01T18:45:51Z","title":"Linear Programming Upper Bounds on Permutation Code Sizes From Coherent Configurations Related to the Kendall Tau Distance Metric"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.0241","kind":"arxiv","version":3},"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:ebe725776e6eb253dc43fa639c008a2b220d704268f9d16a22809cb0416a58af","target":"record","created_at":"2026-05-18T03:54:14Z","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":"63ed261cb4b788e9c443b1360d80303ff12f800774c3d9bab79c8f60d90e4c5d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-01T18:45:51Z","title_canon_sha256":"087f31fac3a86494f9ac914e992da96427b7c543fe6dbc0a8457757e0406e438"},"schema_version":"1.0","source":{"id":"1202.0241","kind":"arxiv","version":3}},"canonical_sha256":"24d4e9f7d1bea8f809109e2012398d4557e94d250c68b0547f32b76a1764753e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"24d4e9f7d1bea8f809109e2012398d4557e94d250c68b0547f32b76a1764753e","first_computed_at":"2026-05-18T03:54:14.907086Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:54:14.907086Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4THSp6mPf9CPhe4DTksB/zCqUH8KGvoONSZBbgJCq50Z8RgjzH7ZeDRwUlUBvH0eXwXldDp0/ulTqV9cMqIcBw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:54:14.907540Z","signed_message":"canonical_sha256_bytes"},"source_id":"1202.0241","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ebe725776e6eb253dc43fa639c008a2b220d704268f9d16a22809cb0416a58af","sha256:7ff8086870695580fdc5424277096396a357f8efee4292ff6b124ed709f87eb2"],"state_sha256":"45cc296568489d1978c0480f355914b1b23e38d706dde1559203d33a20d7cc6e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rmxcVkPJ1IKVYG6x6SvJaBJuny95j9E2WpHzkyxvjnYPlDo9OBH3bu/XJv/qfRecn1bPhQ6qeGgyIICfSlGkCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T12:41:43.352995Z","bundle_sha256":"5437c164c28508705813a896d92b3d1c83490fad88f7ba6b7f1f2e09bdb19234"}}