{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:IGY476KVTRBMZUYYRBKK4DDIHG","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":"4b1f7385cdc2bf50fae8aa6def1f03206460d3931a0ba8c9f18a1566cee37583","cross_cats_sorted":["math.CO","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2025-08-28T16:01:41Z","title_canon_sha256":"e29146758cb61d614b537b3eecb87071f436bc2942983ab6c38329ece40b8dc1"},"schema_version":"1.0","source":{"id":"2508.20940","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2508.20940","created_at":"2026-07-05T12:01:13Z"},{"alias_kind":"arxiv_version","alias_value":"2508.20940v1","created_at":"2026-07-05T12:01:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.20940","created_at":"2026-07-05T12:01:13Z"},{"alias_kind":"pith_short_12","alias_value":"IGY476KVTRBM","created_at":"2026-07-05T12:01:13Z"},{"alias_kind":"pith_short_16","alias_value":"IGY476KVTRBMZUYY","created_at":"2026-07-05T12:01:13Z"},{"alias_kind":"pith_short_8","alias_value":"IGY476KV","created_at":"2026-07-05T12:01:13Z"}],"graph_snapshots":[{"event_id":"sha256:964b12849ec9a54f1e5756020ad6de5d51ebfe6422f16cfaf410fd8793a5addd","target":"graph","created_at":"2026-07-05T12:01:13Z","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/2508.20940/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study perfect codes in the sum-rank metric, a generalization of both the Hamming and rank metrics relevant in multishot network coding and space-time coding. A perfect code attains equality in the sphere-packing bound, corresponding to a partition of the ambient space into disjoint metric balls. While perfect codes in the Hamming and rank metrics are completely classified, the existence of nontrivial perfect codes in the sum-rank metric remains largely open. In this paper, we investigate linear perfect codes in the sum-rank metric. We analyze the geometry of balls and derive bounds on their","authors_text":"Antonio Roccolano, Ferdinando Zullo, Giuseppe Del Prete","cross_cats":["math.CO","math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2025-08-28T16:01:41Z","title":"On the non-existence of perfect codes in the sum-rank metric"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.20940","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:8b4c88f16dc240911b361bce44e018d21e3eda95dd31cd0310d1577999fa3ed8","target":"record","created_at":"2026-07-05T12:01:13Z","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":"4b1f7385cdc2bf50fae8aa6def1f03206460d3931a0ba8c9f18a1566cee37583","cross_cats_sorted":["math.CO","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2025-08-28T16:01:41Z","title_canon_sha256":"e29146758cb61d614b537b3eecb87071f436bc2942983ab6c38329ece40b8dc1"},"schema_version":"1.0","source":{"id":"2508.20940","kind":"arxiv","version":1}},"canonical_sha256":"41b1cff9559c42ccd3188854ae0c68398183101162da5f26af8a9003bb872824","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"41b1cff9559c42ccd3188854ae0c68398183101162da5f26af8a9003bb872824","first_computed_at":"2026-07-05T12:01:13.778177Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T12:01:13.778177Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"h28Nwvs4C2RIFUxqSQdxIxgeRnQn9FkiAVg+UzNjv8WYUqfdsNrP9X98xAGFFVXPAmsgrwygqhY9d9HzScYVCA==","signature_status":"signed_v1","signed_at":"2026-07-05T12:01:13.778665Z","signed_message":"canonical_sha256_bytes"},"source_id":"2508.20940","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8b4c88f16dc240911b361bce44e018d21e3eda95dd31cd0310d1577999fa3ed8","sha256:964b12849ec9a54f1e5756020ad6de5d51ebfe6422f16cfaf410fd8793a5addd"],"state_sha256":"660d3ac8aefc9f8dd968d614076b1d2e093c9a5a9471cc761052e6ad47760208"}