{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:5DVOD7NZNV57KVBKJOOPU57GKX","short_pith_number":"pith:5DVOD7NZ","canonical_record":{"source":{"id":"1908.05650","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2019-08-15T17:47:21Z","cross_cats_sorted":[],"title_canon_sha256":"af25ddf3d7afacdb0ac79d516fd6fbc056f6eb5426f16a7528de9f49d242e484","abstract_canon_sha256":"3662348cd8b81bfa84bb76b4f35a1dcc7e0c0ffee4f764699112499dff307356"},"schema_version":"1.0"},"canonical_sha256":"e8eae1fdb96d7bf5542a4b9cfa77e655c0e78edd63d810ce03f00b1771e7ee40","source":{"kind":"arxiv","id":"1908.05650","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.05650","created_at":"2026-07-04T23:56:54Z"},{"alias_kind":"arxiv_version","alias_value":"1908.05650v1","created_at":"2026-07-04T23:56:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.05650","created_at":"2026-07-04T23:56:54Z"},{"alias_kind":"pith_short_12","alias_value":"5DVOD7NZNV57","created_at":"2026-07-04T23:56:54Z"},{"alias_kind":"pith_short_16","alias_value":"5DVOD7NZNV57KVBK","created_at":"2026-07-04T23:56:54Z"},{"alias_kind":"pith_short_8","alias_value":"5DVOD7NZ","created_at":"2026-07-04T23:56:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:5DVOD7NZNV57KVBKJOOPU57GKX","target":"record","payload":{"canonical_record":{"source":{"id":"1908.05650","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2019-08-15T17:47:21Z","cross_cats_sorted":[],"title_canon_sha256":"af25ddf3d7afacdb0ac79d516fd6fbc056f6eb5426f16a7528de9f49d242e484","abstract_canon_sha256":"3662348cd8b81bfa84bb76b4f35a1dcc7e0c0ffee4f764699112499dff307356"},"schema_version":"1.0"},"canonical_sha256":"e8eae1fdb96d7bf5542a4b9cfa77e655c0e78edd63d810ce03f00b1771e7ee40","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:56:54.768527Z","signature_b64":"oh8xOZ9vn6rYo1V8AKkxkkM374tUDiF35iLeLxCKzUzHrobXY8rpGXIhaKg5VQsVjlx6TXVLPodql74sSyZ1BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e8eae1fdb96d7bf5542a4b9cfa77e655c0e78edd63d810ce03f00b1771e7ee40","last_reissued_at":"2026-07-04T23:56:54.768127Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:56:54.768127Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1908.05650","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-07-04T23:56:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jn9dSwX6jtA5PoA/p3dDw3mnAOiy8BEr6mtf4kGgkdPVnTqPxwpxuj8tY3o113gXKu9LZaEcGk7ZHaSPiVcwAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T16:58:01.521224Z"},"content_sha256":"b47e05678ece9243ade8142e42203e97ed7649fa199e584eb92167f803d1ccfb","schema_version":"1.0","event_id":"sha256:b47e05678ece9243ade8142e42203e97ed7649fa199e584eb92167f803d1ccfb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:5DVOD7NZNV57KVBKJOOPU57GKX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The maximum number of points in the cross-polytope that form a packing set of a scaled cross-polytope","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.MG","authors_text":"Ji Hoon Chun","submitted_at":"2019-08-15T17:47:21Z","abstract_excerpt":"The problem of finding the largest number of points in the unit cross-polytope such that the $l_{1}$-distance between any two distinct points is at least $2r$ is investigated for $r\\in\\left(1-\\frac{1}{n},1\\right]$ in dimensions $\\geq2$ and for $r\\in\\left(\\frac{1}{2},1\\right]$ in dimension $3$. For the $n$-dimensional cross-polytope, $2n$ points can be placed when $r\\in\\left(1-\\frac{1}{n},1\\right]$. For the three-dimensional cross-polytope, $10$ and $12$ points can be placed if and only if $r\\in\\left(\\frac{3}{5},\\frac{2}{3}\\right]$ and $r\\in\\left(\\frac{4}{7},\\frac{3}{5}\\right]$ respectively, an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.05650","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.05650/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-04T23:56:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rLypFBWBLyBevtPTW8o98pZwSYmEO8JAVw6rHD+EAdMCSvza5+7YyLJtXK2zwKq5DU9J5grLultKfPBGoB24BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T16:58:01.522142Z"},"content_sha256":"006a7cbb4e491ed3afe3a6a1b3acdead85c36b44dd2f9de078441babc66dc8ca","schema_version":"1.0","event_id":"sha256:006a7cbb4e491ed3afe3a6a1b3acdead85c36b44dd2f9de078441babc66dc8ca"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5DVOD7NZNV57KVBKJOOPU57GKX/bundle.json","state_url":"https://pith.science/pith/5DVOD7NZNV57KVBKJOOPU57GKX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5DVOD7NZNV57KVBKJOOPU57GKX/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-08-16T16:58:01Z","links":{"resolver":"https://pith.science/pith/5DVOD7NZNV57KVBKJOOPU57GKX","bundle":"https://pith.science/pith/5DVOD7NZNV57KVBKJOOPU57GKX/bundle.json","state":"https://pith.science/pith/5DVOD7NZNV57KVBKJOOPU57GKX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5DVOD7NZNV57KVBKJOOPU57GKX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:5DVOD7NZNV57KVBKJOOPU57GKX","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":"3662348cd8b81bfa84bb76b4f35a1dcc7e0c0ffee4f764699112499dff307356","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2019-08-15T17:47:21Z","title_canon_sha256":"af25ddf3d7afacdb0ac79d516fd6fbc056f6eb5426f16a7528de9f49d242e484"},"schema_version":"1.0","source":{"id":"1908.05650","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.05650","created_at":"2026-07-04T23:56:54Z"},{"alias_kind":"arxiv_version","alias_value":"1908.05650v1","created_at":"2026-07-04T23:56:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.05650","created_at":"2026-07-04T23:56:54Z"},{"alias_kind":"pith_short_12","alias_value":"5DVOD7NZNV57","created_at":"2026-07-04T23:56:54Z"},{"alias_kind":"pith_short_16","alias_value":"5DVOD7NZNV57KVBK","created_at":"2026-07-04T23:56:54Z"},{"alias_kind":"pith_short_8","alias_value":"5DVOD7NZ","created_at":"2026-07-04T23:56:54Z"}],"graph_snapshots":[{"event_id":"sha256:006a7cbb4e491ed3afe3a6a1b3acdead85c36b44dd2f9de078441babc66dc8ca","target":"graph","created_at":"2026-07-04T23:56:54Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1908.05650/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The problem of finding the largest number of points in the unit cross-polytope such that the $l_{1}$-distance between any two distinct points is at least $2r$ is investigated for $r\\in\\left(1-\\frac{1}{n},1\\right]$ in dimensions $\\geq2$ and for $r\\in\\left(\\frac{1}{2},1\\right]$ in dimension $3$. For the $n$-dimensional cross-polytope, $2n$ points can be placed when $r\\in\\left(1-\\frac{1}{n},1\\right]$. For the three-dimensional cross-polytope, $10$ and $12$ points can be placed if and only if $r\\in\\left(\\frac{3}{5},\\frac{2}{3}\\right]$ and $r\\in\\left(\\frac{4}{7},\\frac{3}{5}\\right]$ respectively, an","authors_text":"Ji Hoon Chun","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2019-08-15T17:47:21Z","title":"The maximum number of points in the cross-polytope that form a packing set of a scaled cross-polytope"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.05650","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:b47e05678ece9243ade8142e42203e97ed7649fa199e584eb92167f803d1ccfb","target":"record","created_at":"2026-07-04T23:56:54Z","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":"3662348cd8b81bfa84bb76b4f35a1dcc7e0c0ffee4f764699112499dff307356","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2019-08-15T17:47:21Z","title_canon_sha256":"af25ddf3d7afacdb0ac79d516fd6fbc056f6eb5426f16a7528de9f49d242e484"},"schema_version":"1.0","source":{"id":"1908.05650","kind":"arxiv","version":1}},"canonical_sha256":"e8eae1fdb96d7bf5542a4b9cfa77e655c0e78edd63d810ce03f00b1771e7ee40","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e8eae1fdb96d7bf5542a4b9cfa77e655c0e78edd63d810ce03f00b1771e7ee40","first_computed_at":"2026-07-04T23:56:54.768127Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T23:56:54.768127Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oh8xOZ9vn6rYo1V8AKkxkkM374tUDiF35iLeLxCKzUzHrobXY8rpGXIhaKg5VQsVjlx6TXVLPodql74sSyZ1BA==","signature_status":"signed_v1","signed_at":"2026-07-04T23:56:54.768527Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.05650","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b47e05678ece9243ade8142e42203e97ed7649fa199e584eb92167f803d1ccfb","sha256:006a7cbb4e491ed3afe3a6a1b3acdead85c36b44dd2f9de078441babc66dc8ca"],"state_sha256":"3af7fe299640c89800de49fbb63fe39cd2bb89424012de9fa131265eb10de868"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZFH/8XZ3NdISYHIJiMOtgM8okquDCIK7QBwhGnX2x45i0iU9jqTG4GIq3qgKzJYxLN4LiyAhuvXh9zNUIh8cCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T16:58:01.528021Z","bundle_sha256":"0b497228d8b5e58150cb999514c9ae4f7906eca5b316ccf276349e970397df3c"}}