{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:MZSB5PYBXPU6XZO5EFRUZOCIDF","short_pith_number":"pith:MZSB5PYB","canonical_record":{"source":{"id":"1512.06937","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-12-22T02:58:24Z","cross_cats_sorted":[],"title_canon_sha256":"6860b4e1e63f16f03a0a987ca5ab1101cd8984a70f86142054a0e9b2722cb099","abstract_canon_sha256":"62781f8692747992965aa265ad423b6170f526cd08a309fb1dca791d23d5ef82"},"schema_version":"1.0"},"canonical_sha256":"66641ebf01bbe9ebe5dd21634cb848194c02fd4c1294dbac218990aa185c0587","source":{"kind":"arxiv","id":"1512.06937","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.06937","created_at":"2026-05-18T01:23:53Z"},{"alias_kind":"arxiv_version","alias_value":"1512.06937v1","created_at":"2026-05-18T01:23:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.06937","created_at":"2026-05-18T01:23:53Z"},{"alias_kind":"pith_short_12","alias_value":"MZSB5PYBXPU6","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"MZSB5PYBXPU6XZO5","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"MZSB5PYB","created_at":"2026-05-18T12:29:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:MZSB5PYBXPU6XZO5EFRUZOCIDF","target":"record","payload":{"canonical_record":{"source":{"id":"1512.06937","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-12-22T02:58:24Z","cross_cats_sorted":[],"title_canon_sha256":"6860b4e1e63f16f03a0a987ca5ab1101cd8984a70f86142054a0e9b2722cb099","abstract_canon_sha256":"62781f8692747992965aa265ad423b6170f526cd08a309fb1dca791d23d5ef82"},"schema_version":"1.0"},"canonical_sha256":"66641ebf01bbe9ebe5dd21634cb848194c02fd4c1294dbac218990aa185c0587","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:23:53.419441Z","signature_b64":"5MWwuLd0LUGd/FYrxvEXbhCRv7OWlEQrBIrJO7ZnQqawrUz4FNS4IoFW7bIwpcutZrpnSfZHt+GQ4gqy9F+SAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"66641ebf01bbe9ebe5dd21634cb848194c02fd4c1294dbac218990aa185c0587","last_reissued_at":"2026-05-18T01:23:53.418903Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:23:53.418903Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1512.06937","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-18T01:23:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CQ4rSVOcWsH9/etZB5U65yOO3lKGjPIvJw7sTAWJo5weWYYE7X1o0HSUBuev6DAn+X1u6B/ipTso3X+SoCwAAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T01:40:56.143855Z"},"content_sha256":"517093e34ecab5c971c686275e16c991cd3e39f4ab89bcab321b69ec3b89ea6c","schema_version":"1.0","event_id":"sha256:517093e34ecab5c971c686275e16c991cd3e39f4ab89bcab321b69ec3b89ea6c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:MZSB5PYBXPU6XZO5EFRUZOCIDF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Bandwidth of the Kneser Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Derrek Yager, Tao Jiang, Zevi Miller","submitted_at":"2015-12-22T02:58:24Z","abstract_excerpt":"Let $G = (V,E)$ be a graph on $n$ vertices and $f: V\\rightarrow [1,n]$ a one to one map of $V$ onto the integers $1$ through $n$. Let $dilation(f) =$ max$\\{ |f(v) - f(w)|: vw\\in E \\}$. Define the {\\it bandwidth} $B(G)$ of $G$ to be the minimum possible value of $dilation(f)$ over all such one to one maps $f$. Next define the {\\it Kneser Graph} $K(n,r)$ to be the graph with vertex set $\\binom{[n]}{r}$, the collection of $r$-subsets of an $n$ element set, and edge set $E = \\{ vw: v,w\\in \\binom{[n]}{r}, v\\cap w = \\emptyset \\}$. For fixed $r\\geq 4$ and $n\\rightarrow \\infty$ we show that $$B(K(n,r)"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.06937","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-18T01:23:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"paG8cr7IPy9ygRXiNNDdU3DtdOnYTObIgn3YDNUyn8puzREKy47VtkRUIKIRJn0C/Yy/qLoK4pOkawqNMXMnDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T01:40:56.144838Z"},"content_sha256":"0c5aaa4cbe69eeaa553e3e1a4d4c6d3105252b3ffda35e6c98834e923f9fc286","schema_version":"1.0","event_id":"sha256:0c5aaa4cbe69eeaa553e3e1a4d4c6d3105252b3ffda35e6c98834e923f9fc286"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MZSB5PYBXPU6XZO5EFRUZOCIDF/bundle.json","state_url":"https://pith.science/pith/MZSB5PYBXPU6XZO5EFRUZOCIDF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MZSB5PYBXPU6XZO5EFRUZOCIDF/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-01T01:40:56Z","links":{"resolver":"https://pith.science/pith/MZSB5PYBXPU6XZO5EFRUZOCIDF","bundle":"https://pith.science/pith/MZSB5PYBXPU6XZO5EFRUZOCIDF/bundle.json","state":"https://pith.science/pith/MZSB5PYBXPU6XZO5EFRUZOCIDF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MZSB5PYBXPU6XZO5EFRUZOCIDF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:MZSB5PYBXPU6XZO5EFRUZOCIDF","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":"62781f8692747992965aa265ad423b6170f526cd08a309fb1dca791d23d5ef82","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-12-22T02:58:24Z","title_canon_sha256":"6860b4e1e63f16f03a0a987ca5ab1101cd8984a70f86142054a0e9b2722cb099"},"schema_version":"1.0","source":{"id":"1512.06937","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.06937","created_at":"2026-05-18T01:23:53Z"},{"alias_kind":"arxiv_version","alias_value":"1512.06937v1","created_at":"2026-05-18T01:23:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.06937","created_at":"2026-05-18T01:23:53Z"},{"alias_kind":"pith_short_12","alias_value":"MZSB5PYBXPU6","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"MZSB5PYBXPU6XZO5","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"MZSB5PYB","created_at":"2026-05-18T12:29:32Z"}],"graph_snapshots":[{"event_id":"sha256:0c5aaa4cbe69eeaa553e3e1a4d4c6d3105252b3ffda35e6c98834e923f9fc286","target":"graph","created_at":"2026-05-18T01:23:53Z","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":"Let $G = (V,E)$ be a graph on $n$ vertices and $f: V\\rightarrow [1,n]$ a one to one map of $V$ onto the integers $1$ through $n$. Let $dilation(f) =$ max$\\{ |f(v) - f(w)|: vw\\in E \\}$. Define the {\\it bandwidth} $B(G)$ of $G$ to be the minimum possible value of $dilation(f)$ over all such one to one maps $f$. Next define the {\\it Kneser Graph} $K(n,r)$ to be the graph with vertex set $\\binom{[n]}{r}$, the collection of $r$-subsets of an $n$ element set, and edge set $E = \\{ vw: v,w\\in \\binom{[n]}{r}, v\\cap w = \\emptyset \\}$. For fixed $r\\geq 4$ and $n\\rightarrow \\infty$ we show that $$B(K(n,r)","authors_text":"Derrek Yager, Tao Jiang, Zevi Miller","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-12-22T02:58:24Z","title":"On the Bandwidth of the Kneser Graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.06937","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:517093e34ecab5c971c686275e16c991cd3e39f4ab89bcab321b69ec3b89ea6c","target":"record","created_at":"2026-05-18T01:23:53Z","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":"62781f8692747992965aa265ad423b6170f526cd08a309fb1dca791d23d5ef82","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-12-22T02:58:24Z","title_canon_sha256":"6860b4e1e63f16f03a0a987ca5ab1101cd8984a70f86142054a0e9b2722cb099"},"schema_version":"1.0","source":{"id":"1512.06937","kind":"arxiv","version":1}},"canonical_sha256":"66641ebf01bbe9ebe5dd21634cb848194c02fd4c1294dbac218990aa185c0587","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"66641ebf01bbe9ebe5dd21634cb848194c02fd4c1294dbac218990aa185c0587","first_computed_at":"2026-05-18T01:23:53.418903Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:23:53.418903Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5MWwuLd0LUGd/FYrxvEXbhCRv7OWlEQrBIrJO7ZnQqawrUz4FNS4IoFW7bIwpcutZrpnSfZHt+GQ4gqy9F+SAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:23:53.419441Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.06937","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:517093e34ecab5c971c686275e16c991cd3e39f4ab89bcab321b69ec3b89ea6c","sha256:0c5aaa4cbe69eeaa553e3e1a4d4c6d3105252b3ffda35e6c98834e923f9fc286"],"state_sha256":"1b7e93e6f416872839c8b454b3ebb6ede12a994f9e1bdb1f9670ac39f45b25aa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RFB5580D4xKxVKQbjkTFCJXLo0gxeCfjEqLH7OFQEYCf5SoRDiDJ5AGOp3m1wwBPOqVHu9OwmPYeFDjL99KpAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T01:40:56.149484Z","bundle_sha256":"7a54ba4d33c9b4130c5885e8b7305476b59ecdeb8367e95663cf98af075f338d"}}