{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:6JRP4YETTI435THA7YCXZQKGAM","short_pith_number":"pith:6JRP4YET","schema_version":"1.0","canonical_sha256":"f262fe60939a39becce0fe057cc14603260b7478ec290794cf4587db780838e2","source":{"kind":"arxiv","id":"2504.07036","version":1},"attestation_state":"computed","paper":{"title":"Hegedus' Conjecture and Tighter Upper Bounds for Equidistant Codes in Hamming Spaces","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hexiang Huang, Sihuang Hu, Wei-Hsuan Yu","submitted_at":"2025-04-09T16:52:33Z","abstract_excerpt":"An equidistant code is a code in the Hamming space such that two distinct codewords have the same Hamming distance. This paper investigates the bounds for equidistant codes in Hamming spaces."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2504.07036","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-04-09T16:52:33Z","cross_cats_sorted":[],"title_canon_sha256":"7085c5f6a8943cc8a84fb44f93cc1fcdc253fd2df64a789257a65712ce3890f2","abstract_canon_sha256":"0c643ff0c06c4ea696e1c5e0d15ccb470580ac2654c0b0c9dbc7ebfbbf8e5b0d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:46:50.147192Z","signature_b64":"3CRbtfMumpNi9lqr+Qbi/Gymc2aFLjwdGkvQ+s+WyZ+grBROSePe/bSWP861+nCubjZcz4AEk9h76ye/WKmWBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f262fe60939a39becce0fe057cc14603260b7478ec290794cf4587db780838e2","last_reissued_at":"2026-07-05T10:46:50.146784Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:46:50.146784Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hegedus' Conjecture and Tighter Upper Bounds for Equidistant Codes in Hamming Spaces","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hexiang Huang, Sihuang Hu, Wei-Hsuan Yu","submitted_at":"2025-04-09T16:52:33Z","abstract_excerpt":"An equidistant code is a code in the Hamming space such that two distinct codewords have the same Hamming distance. This paper investigates the bounds for equidistant codes in Hamming spaces."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.07036","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/2504.07036/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2504.07036","created_at":"2026-07-05T10:46:50.146855+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.07036v1","created_at":"2026-07-05T10:46:50.146855+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.07036","created_at":"2026-07-05T10:46:50.146855+00:00"},{"alias_kind":"pith_short_12","alias_value":"6JRP4YETTI43","created_at":"2026-07-05T10:46:50.146855+00:00"},{"alias_kind":"pith_short_16","alias_value":"6JRP4YETTI435THA","created_at":"2026-07-05T10:46:50.146855+00:00"},{"alias_kind":"pith_short_8","alias_value":"6JRP4YET","created_at":"2026-07-05T10:46:50.146855+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.24624","citing_title":"An eigenvalue proof of Heged\\\"{u}s's bound for codes with a single Hamming distance","ref_index":5,"is_internal_anchor":false},{"citing_arxiv_id":"2606.29022","citing_title":"An Explication of Optimal Equidistant Codes","ref_index":10,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6JRP4YETTI435THA7YCXZQKGAM","json":"https://pith.science/pith/6JRP4YETTI435THA7YCXZQKGAM.json","graph_json":"https://pith.science/api/pith-number/6JRP4YETTI435THA7YCXZQKGAM/graph.json","events_json":"https://pith.science/api/pith-number/6JRP4YETTI435THA7YCXZQKGAM/events.json","paper":"https://pith.science/paper/6JRP4YET"},"agent_actions":{"view_html":"https://pith.science/pith/6JRP4YETTI435THA7YCXZQKGAM","download_json":"https://pith.science/pith/6JRP4YETTI435THA7YCXZQKGAM.json","view_paper":"https://pith.science/paper/6JRP4YET","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.07036&json=true","fetch_graph":"https://pith.science/api/pith-number/6JRP4YETTI435THA7YCXZQKGAM/graph.json","fetch_events":"https://pith.science/api/pith-number/6JRP4YETTI435THA7YCXZQKGAM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6JRP4YETTI435THA7YCXZQKGAM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6JRP4YETTI435THA7YCXZQKGAM/action/storage_attestation","attest_author":"https://pith.science/pith/6JRP4YETTI435THA7YCXZQKGAM/action/author_attestation","sign_citation":"https://pith.science/pith/6JRP4YETTI435THA7YCXZQKGAM/action/citation_signature","submit_replication":"https://pith.science/pith/6JRP4YETTI435THA7YCXZQKGAM/action/replication_record"}},"created_at":"2026-07-05T10:46:50.146855+00:00","updated_at":"2026-07-05T10:46:50.146855+00:00"}