{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:OOCYFF764YUVVNNNBPPARD3CO7","short_pith_number":"pith:OOCYFF76","canonical_record":{"source":{"id":"2507.10828","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2025-07-14T21:47:08Z","cross_cats_sorted":[],"title_canon_sha256":"9c855224137718ef49dd2b92625a8b2c38d244deba1b120c529722fef9f08013","abstract_canon_sha256":"db6397496f8c07c239a686beb651494a37f3b307132857d7bb01e67a49cd579f"},"schema_version":"1.0"},"canonical_sha256":"73858297fee6295ab5ad0bde088f6277dbf2f7b50c4b1d5753dbc009d715ad22","source":{"kind":"arxiv","id":"2507.10828","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.10828","created_at":"2026-07-05T11:37:00Z"},{"alias_kind":"arxiv_version","alias_value":"2507.10828v1","created_at":"2026-07-05T11:37:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.10828","created_at":"2026-07-05T11:37:00Z"},{"alias_kind":"pith_short_12","alias_value":"OOCYFF764YUV","created_at":"2026-07-05T11:37:00Z"},{"alias_kind":"pith_short_16","alias_value":"OOCYFF764YUVVNNN","created_at":"2026-07-05T11:37:00Z"},{"alias_kind":"pith_short_8","alias_value":"OOCYFF76","created_at":"2026-07-05T11:37:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:OOCYFF764YUVVNNNBPPARD3CO7","target":"record","payload":{"canonical_record":{"source":{"id":"2507.10828","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2025-07-14T21:47:08Z","cross_cats_sorted":[],"title_canon_sha256":"9c855224137718ef49dd2b92625a8b2c38d244deba1b120c529722fef9f08013","abstract_canon_sha256":"db6397496f8c07c239a686beb651494a37f3b307132857d7bb01e67a49cd579f"},"schema_version":"1.0"},"canonical_sha256":"73858297fee6295ab5ad0bde088f6277dbf2f7b50c4b1d5753dbc009d715ad22","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:37:00.382361Z","signature_b64":"JNmdpmXu9C6ZRBWjCcB0H+8sfnRMxaWnV5yBfki3JBp9a3HE8Cj1NbnK9zfVg9dFWSi1MlCQlVUf5UAd9LIwCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"73858297fee6295ab5ad0bde088f6277dbf2f7b50c4b1d5753dbc009d715ad22","last_reissued_at":"2026-07-05T11:37:00.381895Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:37:00.381895Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2507.10828","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-05T11:37:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QVFrSNF9JIXpyPt3sfRC13XNr8ZNDg14szY6mTzolElxjAmbJl8Ghj61LvJOfrnrW2GrxnVJvbRhjsnfd4psDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T22:15:57.777198Z"},"content_sha256":"f29dc2b85f38c6a5390c95f62e12e72f7bc3cead4021b3241655e08b660654d3","schema_version":"1.0","event_id":"sha256:f29dc2b85f38c6a5390c95f62e12e72f7bc3cead4021b3241655e08b660654d3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:OOCYFF764YUVVNNNBPPARD3CO7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Maximal sets of a given diameter in Hamming cubes","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Aleksandre Saatashvili, Boris Bukh","submitted_at":"2025-07-14T21:47:08Z","abstract_excerpt":"A subset of the Hamming cube over $n$-letter alphabet is said to be $d$-maximal if its diameter is $d$, and adding any point increases the diameter. Our main result shows that each $d$-maximal set is either of size at most $(n+o(n))^d$ or contains a non-trivial Hamming ball. The bound of $(n+o(n))^d$ is asymptotically tight. Additionally, we give a non-trivial lower bound on the size of any $d$-maximal set and show that the number of essentially different $d$-maximal sets is finite."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.10828","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/2507.10828/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-05T11:37:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UvwVzY1aDyJuBn25VV80U+XhnItb0ggOgMp9adozOu3QtxJbZ9cQc9gdRfTqwLU2QxFznh8F+bXptN/0GwLbBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T22:15:57.777561Z"},"content_sha256":"33c63e71f18edc03dc72d7a01f41a9a0e2a447b4ecefdb879d4a9cc58def85ea","schema_version":"1.0","event_id":"sha256:33c63e71f18edc03dc72d7a01f41a9a0e2a447b4ecefdb879d4a9cc58def85ea"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OOCYFF764YUVVNNNBPPARD3CO7/bundle.json","state_url":"https://pith.science/pith/OOCYFF764YUVVNNNBPPARD3CO7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OOCYFF764YUVVNNNBPPARD3CO7/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-19T22:15:57Z","links":{"resolver":"https://pith.science/pith/OOCYFF764YUVVNNNBPPARD3CO7","bundle":"https://pith.science/pith/OOCYFF764YUVVNNNBPPARD3CO7/bundle.json","state":"https://pith.science/pith/OOCYFF764YUVVNNNBPPARD3CO7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OOCYFF764YUVVNNNBPPARD3CO7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:OOCYFF764YUVVNNNBPPARD3CO7","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":"db6397496f8c07c239a686beb651494a37f3b307132857d7bb01e67a49cd579f","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2025-07-14T21:47:08Z","title_canon_sha256":"9c855224137718ef49dd2b92625a8b2c38d244deba1b120c529722fef9f08013"},"schema_version":"1.0","source":{"id":"2507.10828","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.10828","created_at":"2026-07-05T11:37:00Z"},{"alias_kind":"arxiv_version","alias_value":"2507.10828v1","created_at":"2026-07-05T11:37:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.10828","created_at":"2026-07-05T11:37:00Z"},{"alias_kind":"pith_short_12","alias_value":"OOCYFF764YUV","created_at":"2026-07-05T11:37:00Z"},{"alias_kind":"pith_short_16","alias_value":"OOCYFF764YUVVNNN","created_at":"2026-07-05T11:37:00Z"},{"alias_kind":"pith_short_8","alias_value":"OOCYFF76","created_at":"2026-07-05T11:37:00Z"}],"graph_snapshots":[{"event_id":"sha256:33c63e71f18edc03dc72d7a01f41a9a0e2a447b4ecefdb879d4a9cc58def85ea","target":"graph","created_at":"2026-07-05T11:37:00Z","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/2507.10828/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A subset of the Hamming cube over $n$-letter alphabet is said to be $d$-maximal if its diameter is $d$, and adding any point increases the diameter. Our main result shows that each $d$-maximal set is either of size at most $(n+o(n))^d$ or contains a non-trivial Hamming ball. The bound of $(n+o(n))^d$ is asymptotically tight. Additionally, we give a non-trivial lower bound on the size of any $d$-maximal set and show that the number of essentially different $d$-maximal sets is finite.","authors_text":"Aleksandre Saatashvili, Boris Bukh","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2025-07-14T21:47:08Z","title":"Maximal sets of a given diameter in Hamming cubes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.10828","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:f29dc2b85f38c6a5390c95f62e12e72f7bc3cead4021b3241655e08b660654d3","target":"record","created_at":"2026-07-05T11:37:00Z","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":"db6397496f8c07c239a686beb651494a37f3b307132857d7bb01e67a49cd579f","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2025-07-14T21:47:08Z","title_canon_sha256":"9c855224137718ef49dd2b92625a8b2c38d244deba1b120c529722fef9f08013"},"schema_version":"1.0","source":{"id":"2507.10828","kind":"arxiv","version":1}},"canonical_sha256":"73858297fee6295ab5ad0bde088f6277dbf2f7b50c4b1d5753dbc009d715ad22","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"73858297fee6295ab5ad0bde088f6277dbf2f7b50c4b1d5753dbc009d715ad22","first_computed_at":"2026-07-05T11:37:00.381895Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:37:00.381895Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JNmdpmXu9C6ZRBWjCcB0H+8sfnRMxaWnV5yBfki3JBp9a3HE8Cj1NbnK9zfVg9dFWSi1MlCQlVUf5UAd9LIwCA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:37:00.382361Z","signed_message":"canonical_sha256_bytes"},"source_id":"2507.10828","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f29dc2b85f38c6a5390c95f62e12e72f7bc3cead4021b3241655e08b660654d3","sha256:33c63e71f18edc03dc72d7a01f41a9a0e2a447b4ecefdb879d4a9cc58def85ea"],"state_sha256":"bf5f83392db8a4cf6e37c676490b6ecec284fbbae69a9e865d6cb6cde9aaa5d9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a+VWNK2CG5Iqg2GPw9UBSKF/q2sNQ019ZY+THqwlp+l9sbUNoPYyvbBq9Kle5F/TBoPB86hzBCzmfUhmaqcLBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-19T22:15:57.779826Z","bundle_sha256":"24a367b220c475e23dc253d9a56e8bfc375170fded8b68a356ab8d4abc1dc918"}}