{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:3T4UX2XHIBCIIWRL3R5WBQD5QU","short_pith_number":"pith:3T4UX2XH","canonical_record":{"source":{"id":"1907.07848","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2019-07-18T02:50:46Z","cross_cats_sorted":["math.FA"],"title_canon_sha256":"56a2e355ee7319e2b25040d0d1ce8921da90ef388f71bb00344c68ebacc7f833","abstract_canon_sha256":"b15f7841519904338347d6a351d01fdf2e7d446e17cf6a0a3339fad861b9892e"},"schema_version":"1.0"},"canonical_sha256":"dcf94beae74044845a2bdc7b60c07d853ed05d9ddde78a2cc91122ea2c5648cb","source":{"kind":"arxiv","id":"1907.07848","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.07848","created_at":"2026-05-17T23:40:15Z"},{"alias_kind":"arxiv_version","alias_value":"1907.07848v1","created_at":"2026-05-17T23:40:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.07848","created_at":"2026-05-17T23:40:15Z"},{"alias_kind":"pith_short_12","alias_value":"3T4UX2XHIBCI","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"3T4UX2XHIBCIIWRL","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"3T4UX2XH","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:3T4UX2XHIBCIIWRL3R5WBQD5QU","target":"record","payload":{"canonical_record":{"source":{"id":"1907.07848","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2019-07-18T02:50:46Z","cross_cats_sorted":["math.FA"],"title_canon_sha256":"56a2e355ee7319e2b25040d0d1ce8921da90ef388f71bb00344c68ebacc7f833","abstract_canon_sha256":"b15f7841519904338347d6a351d01fdf2e7d446e17cf6a0a3339fad861b9892e"},"schema_version":"1.0"},"canonical_sha256":"dcf94beae74044845a2bdc7b60c07d853ed05d9ddde78a2cc91122ea2c5648cb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:15.994211Z","signature_b64":"AEJA0nNtzcUiUqE0oMovne0lvz94aiujoK1CQfDTCty+UrE42pE16vKCvRSXuszCtKwuJBIdhHGoOYNjcNw1Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dcf94beae74044845a2bdc7b60c07d853ed05d9ddde78a2cc91122ea2c5648cb","last_reissued_at":"2026-05-17T23:40:15.993395Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:15.993395Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.07848","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-17T23:40:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qE09qgraLF0SQ55lgjjhKOZkVXfxe0nQE4U1uwHIEFudc2ORqhFxUR1equXkKozARZy+XqIGMWhhZoY9EDWyAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T23:36:51.402400Z"},"content_sha256":"932578426f43372ca43a71c4ae90b5563e50f86d26ada2d294fb884d40157334","schema_version":"1.0","event_id":"sha256:932578426f43372ca43a71c4ae90b5563e50f86d26ada2d294fb884d40157334"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:3T4UX2XHIBCIIWRL3R5WBQD5QU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Game of Sloanes: Best known packings in complex projective space","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.FA"],"primary_cat":"math.MG","authors_text":"Dustin G. Mixon, Emily J. King, John Jasper","submitted_at":"2019-07-18T02:50:46Z","abstract_excerpt":"It is often of interest to identify a given number of points in projective space such that the minimum distance between any two points is as large as possible. Such configurations yield representations of data that are optimally robust to noise and erasures. The minimum distance of an optimal configuration not only depends on the number of points and the dimension of the projective space, but also on whether the space is real or complex. For decades, Neil Sloane's online Table of Grassmannian Packings has been the go-to resource for putatively or provably optimal packings of points in real pro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.07848","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-17T23:40:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tgFxddXpaxgeiFpmCAT7LmhNQW4bGZdSWTwVaMxHpP6V/Sz7meJFrdOKJd5XhpfYIwbC82eqATgDN2spXaEYAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T23:36:51.403076Z"},"content_sha256":"0cabea1d6d039df2928d021debf83b1b904321064a36b575ba5cc6da67673874","schema_version":"1.0","event_id":"sha256:0cabea1d6d039df2928d021debf83b1b904321064a36b575ba5cc6da67673874"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3T4UX2XHIBCIIWRL3R5WBQD5QU/bundle.json","state_url":"https://pith.science/pith/3T4UX2XHIBCIIWRL3R5WBQD5QU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3T4UX2XHIBCIIWRL3R5WBQD5QU/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-05-25T23:36:51Z","links":{"resolver":"https://pith.science/pith/3T4UX2XHIBCIIWRL3R5WBQD5QU","bundle":"https://pith.science/pith/3T4UX2XHIBCIIWRL3R5WBQD5QU/bundle.json","state":"https://pith.science/pith/3T4UX2XHIBCIIWRL3R5WBQD5QU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3T4UX2XHIBCIIWRL3R5WBQD5QU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:3T4UX2XHIBCIIWRL3R5WBQD5QU","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":"b15f7841519904338347d6a351d01fdf2e7d446e17cf6a0a3339fad861b9892e","cross_cats_sorted":["math.FA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2019-07-18T02:50:46Z","title_canon_sha256":"56a2e355ee7319e2b25040d0d1ce8921da90ef388f71bb00344c68ebacc7f833"},"schema_version":"1.0","source":{"id":"1907.07848","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.07848","created_at":"2026-05-17T23:40:15Z"},{"alias_kind":"arxiv_version","alias_value":"1907.07848v1","created_at":"2026-05-17T23:40:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.07848","created_at":"2026-05-17T23:40:15Z"},{"alias_kind":"pith_short_12","alias_value":"3T4UX2XHIBCI","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"3T4UX2XHIBCIIWRL","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"3T4UX2XH","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:0cabea1d6d039df2928d021debf83b1b904321064a36b575ba5cc6da67673874","target":"graph","created_at":"2026-05-17T23:40: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":"It is often of interest to identify a given number of points in projective space such that the minimum distance between any two points is as large as possible. Such configurations yield representations of data that are optimally robust to noise and erasures. The minimum distance of an optimal configuration not only depends on the number of points and the dimension of the projective space, but also on whether the space is real or complex. For decades, Neil Sloane's online Table of Grassmannian Packings has been the go-to resource for putatively or provably optimal packings of points in real pro","authors_text":"Dustin G. Mixon, Emily J. King, John Jasper","cross_cats":["math.FA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2019-07-18T02:50:46Z","title":"Game of Sloanes: Best known packings in complex projective space"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.07848","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:932578426f43372ca43a71c4ae90b5563e50f86d26ada2d294fb884d40157334","target":"record","created_at":"2026-05-17T23:40: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":"b15f7841519904338347d6a351d01fdf2e7d446e17cf6a0a3339fad861b9892e","cross_cats_sorted":["math.FA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2019-07-18T02:50:46Z","title_canon_sha256":"56a2e355ee7319e2b25040d0d1ce8921da90ef388f71bb00344c68ebacc7f833"},"schema_version":"1.0","source":{"id":"1907.07848","kind":"arxiv","version":1}},"canonical_sha256":"dcf94beae74044845a2bdc7b60c07d853ed05d9ddde78a2cc91122ea2c5648cb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dcf94beae74044845a2bdc7b60c07d853ed05d9ddde78a2cc91122ea2c5648cb","first_computed_at":"2026-05-17T23:40:15.993395Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:40:15.993395Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AEJA0nNtzcUiUqE0oMovne0lvz94aiujoK1CQfDTCty+UrE42pE16vKCvRSXuszCtKwuJBIdhHGoOYNjcNw1Ag==","signature_status":"signed_v1","signed_at":"2026-05-17T23:40:15.994211Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.07848","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:932578426f43372ca43a71c4ae90b5563e50f86d26ada2d294fb884d40157334","sha256:0cabea1d6d039df2928d021debf83b1b904321064a36b575ba5cc6da67673874"],"state_sha256":"33e048b0794ec186a350b01d4364105c757b3fd93b1f098801245711814b4ceb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0sPaW0JpReWENOf3h7iWyLk0j03WYJU971KmbnZjLpZEIHZbWTGrI/LsVX9FQmwQjxFl1B+JEk2OpQg9p0BSAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T23:36:51.406563Z","bundle_sha256":"edec77aa7de024781b31a56caf5979bbbbb75248f018d668e6f81b8ea185ca76"}}