{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:R52VM2OAJZALY4VL4L5T2ZHVEB","short_pith_number":"pith:R52VM2OA","canonical_record":{"source":{"id":"1902.00926","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2019-02-03T16:54:25Z","cross_cats_sorted":["cs.IT","math.CO","math.IT"],"title_canon_sha256":"666fde9702d394101b4f6662b9575293db917989936fb9609a514d057d7ee969","abstract_canon_sha256":"dc2e7e177b86dc0bf6e1cb0bb4b1689ac7f4c78348fa4e91e32a425e9c2cf0e7"},"schema_version":"1.0"},"canonical_sha256":"8f755669c04e40bc72abe2fb3d64f5206856c9247cd13f3c56fcb3ec81f0c23d","source":{"kind":"arxiv","id":"1902.00926","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.00926","created_at":"2026-05-17T23:47:15Z"},{"alias_kind":"arxiv_version","alias_value":"1902.00926v3","created_at":"2026-05-17T23:47:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.00926","created_at":"2026-05-17T23:47:15Z"},{"alias_kind":"pith_short_12","alias_value":"R52VM2OAJZAL","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"R52VM2OAJZALY4VL","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"R52VM2OA","created_at":"2026-05-18T12:33:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:R52VM2OAJZALY4VL4L5T2ZHVEB","target":"record","payload":{"canonical_record":{"source":{"id":"1902.00926","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2019-02-03T16:54:25Z","cross_cats_sorted":["cs.IT","math.CO","math.IT"],"title_canon_sha256":"666fde9702d394101b4f6662b9575293db917989936fb9609a514d057d7ee969","abstract_canon_sha256":"dc2e7e177b86dc0bf6e1cb0bb4b1689ac7f4c78348fa4e91e32a425e9c2cf0e7"},"schema_version":"1.0"},"canonical_sha256":"8f755669c04e40bc72abe2fb3d64f5206856c9247cd13f3c56fcb3ec81f0c23d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:15.658005Z","signature_b64":"hwwBEw+L8rP0sZ2/N+bZaKy21zCtB6NSPfonxPzYZqjxc0yINLtxzlBCP2FpyEm4wAbgXwwwzcx6GY3JFil+Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8f755669c04e40bc72abe2fb3d64f5206856c9247cd13f3c56fcb3ec81f0c23d","last_reissued_at":"2026-05-17T23:47:15.657603Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:15.657603Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.00926","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-17T23:47:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nKViQn6W2h+Q63UrhiRaXGcCVB3id96smplPQ/6gua0nLkUOOhcdNOLiyGBxCeIZMD5XeT0tFKjlDK6KawN5DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T01:25:18.042470Z"},"content_sha256":"1c4a95b69052e6c49f2a1f2dd29a1dd2d631c9b9ca9627d9ee96988f4d356eb9","schema_version":"1.0","event_id":"sha256:1c4a95b69052e6c49f2a1f2dd29a1dd2d631c9b9ca9627d9ee96988f4d356eb9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:R52VM2OAJZALY4VL4L5T2ZHVEB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Delsarte-Style Proof of the Bukh-Cox Bound","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.CO","math.IT"],"primary_cat":"math.MG","authors_text":"Dustin G. Mixon, Hans Parshall, Mark Magsino","submitted_at":"2019-02-03T16:54:25Z","abstract_excerpt":"The line packing problem is concerned with the optimal packing of points in real or complex projective space so that the minimum distance between points is maximized. Until recently, all bounds on optimal line packings were known to be derivable from Delsarte's linear program. Last year, Bukh and Cox introduced a new bound for the line packing problem using completely different techniques. In this paper, we use ideas from the Bukh--Cox proof to find a new proof of the Welch bound, and then we use ideas from Delsarte's linear program to find a new proof of the Bukh--Cox bound. Hopefully, these "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.00926","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-17T23:47:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DnHXNenDfV+bWc8QaGyoaeQCL6mH8EB6ycH4cXZvXQgKuDyg7l2AVmHvWp0qRN7CYPtyyMxO1pUYJkS/GfU5Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T01:25:18.042823Z"},"content_sha256":"0e6be3f72fd172350272d049801828790888682e53e68aa3f9a4905d07369abb","schema_version":"1.0","event_id":"sha256:0e6be3f72fd172350272d049801828790888682e53e68aa3f9a4905d07369abb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/R52VM2OAJZALY4VL4L5T2ZHVEB/bundle.json","state_url":"https://pith.science/pith/R52VM2OAJZALY4VL4L5T2ZHVEB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/R52VM2OAJZALY4VL4L5T2ZHVEB/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-04T01:25:18Z","links":{"resolver":"https://pith.science/pith/R52VM2OAJZALY4VL4L5T2ZHVEB","bundle":"https://pith.science/pith/R52VM2OAJZALY4VL4L5T2ZHVEB/bundle.json","state":"https://pith.science/pith/R52VM2OAJZALY4VL4L5T2ZHVEB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/R52VM2OAJZALY4VL4L5T2ZHVEB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:R52VM2OAJZALY4VL4L5T2ZHVEB","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":"dc2e7e177b86dc0bf6e1cb0bb4b1689ac7f4c78348fa4e91e32a425e9c2cf0e7","cross_cats_sorted":["cs.IT","math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2019-02-03T16:54:25Z","title_canon_sha256":"666fde9702d394101b4f6662b9575293db917989936fb9609a514d057d7ee969"},"schema_version":"1.0","source":{"id":"1902.00926","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.00926","created_at":"2026-05-17T23:47:15Z"},{"alias_kind":"arxiv_version","alias_value":"1902.00926v3","created_at":"2026-05-17T23:47:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.00926","created_at":"2026-05-17T23:47:15Z"},{"alias_kind":"pith_short_12","alias_value":"R52VM2OAJZAL","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"R52VM2OAJZALY4VL","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"R52VM2OA","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:0e6be3f72fd172350272d049801828790888682e53e68aa3f9a4905d07369abb","target":"graph","created_at":"2026-05-17T23:47:15Z","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":"The line packing problem is concerned with the optimal packing of points in real or complex projective space so that the minimum distance between points is maximized. Until recently, all bounds on optimal line packings were known to be derivable from Delsarte's linear program. Last year, Bukh and Cox introduced a new bound for the line packing problem using completely different techniques. In this paper, we use ideas from the Bukh--Cox proof to find a new proof of the Welch bound, and then we use ideas from Delsarte's linear program to find a new proof of the Bukh--Cox bound. Hopefully, these ","authors_text":"Dustin G. Mixon, Hans Parshall, Mark Magsino","cross_cats":["cs.IT","math.CO","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2019-02-03T16:54:25Z","title":"A Delsarte-Style Proof of the Bukh-Cox Bound"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.00926","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:1c4a95b69052e6c49f2a1f2dd29a1dd2d631c9b9ca9627d9ee96988f4d356eb9","target":"record","created_at":"2026-05-17T23:47:15Z","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":"dc2e7e177b86dc0bf6e1cb0bb4b1689ac7f4c78348fa4e91e32a425e9c2cf0e7","cross_cats_sorted":["cs.IT","math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2019-02-03T16:54:25Z","title_canon_sha256":"666fde9702d394101b4f6662b9575293db917989936fb9609a514d057d7ee969"},"schema_version":"1.0","source":{"id":"1902.00926","kind":"arxiv","version":3}},"canonical_sha256":"8f755669c04e40bc72abe2fb3d64f5206856c9247cd13f3c56fcb3ec81f0c23d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8f755669c04e40bc72abe2fb3d64f5206856c9247cd13f3c56fcb3ec81f0c23d","first_computed_at":"2026-05-17T23:47:15.657603Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:47:15.657603Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hwwBEw+L8rP0sZ2/N+bZaKy21zCtB6NSPfonxPzYZqjxc0yINLtxzlBCP2FpyEm4wAbgXwwwzcx6GY3JFil+Cw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:47:15.658005Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.00926","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1c4a95b69052e6c49f2a1f2dd29a1dd2d631c9b9ca9627d9ee96988f4d356eb9","sha256:0e6be3f72fd172350272d049801828790888682e53e68aa3f9a4905d07369abb"],"state_sha256":"c2275020cf5f80a2539a26046af009a14829c5885cbdd39330e6063bfd46d65a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"09R8Cc8Sa+nTFrhAoTQNyMZf/Oz50L2JcFIRjSbcrEcwzRSlg85Ck536ZB68rlvD4SUyuuopjva69ml2qG2RDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T01:25:18.045116Z","bundle_sha256":"7f347f62fc3335847faac5c1934aa02ac2b6226465c98cb72fded848afaeb823"}}