{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:2ZBC27GUI6G5JKMNUX2KCBRBHW","short_pith_number":"pith:2ZBC27GU","canonical_record":{"source":{"id":"2605.21784","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-05-20T22:23:06Z","cross_cats_sorted":["math.AG","math.CO","math.IT"],"title_canon_sha256":"b4fc4ac66236d7afe53c1fdc4d6ead33a68246ce8d7f6097d5976290bfb9be0c","abstract_canon_sha256":"f79061bdf71c189ddfe27e1de549c9e51a6702255ec0b54c6cf30e18418334b1"},"schema_version":"1.0"},"canonical_sha256":"d6422d7cd4478dd4a98da5f4a106213dbac9e5fffb4721552f76f6fb981713a0","source":{"kind":"arxiv","id":"2605.21784","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.21784","created_at":"2026-05-22T01:03:32Z"},{"alias_kind":"arxiv_version","alias_value":"2605.21784v1","created_at":"2026-05-22T01:03:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.21784","created_at":"2026-05-22T01:03:32Z"},{"alias_kind":"pith_short_12","alias_value":"2ZBC27GUI6G5","created_at":"2026-05-22T01:03:32Z"},{"alias_kind":"pith_short_16","alias_value":"2ZBC27GUI6G5JKMN","created_at":"2026-05-22T01:03:32Z"},{"alias_kind":"pith_short_8","alias_value":"2ZBC27GU","created_at":"2026-05-22T01:03:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:2ZBC27GUI6G5JKMNUX2KCBRBHW","target":"record","payload":{"canonical_record":{"source":{"id":"2605.21784","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-05-20T22:23:06Z","cross_cats_sorted":["math.AG","math.CO","math.IT"],"title_canon_sha256":"b4fc4ac66236d7afe53c1fdc4d6ead33a68246ce8d7f6097d5976290bfb9be0c","abstract_canon_sha256":"f79061bdf71c189ddfe27e1de549c9e51a6702255ec0b54c6cf30e18418334b1"},"schema_version":"1.0"},"canonical_sha256":"d6422d7cd4478dd4a98da5f4a106213dbac9e5fffb4721552f76f6fb981713a0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-22T01:03:32.361835Z","signature_b64":"VH21Iv3UaDslM0z+5ueH7QD3K9wpoYxX2dyEvu0P0UE1lY497sC6TlgX9W++SvBA+Cbxa74C/YGL4pG3E1gYBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d6422d7cd4478dd4a98da5f4a106213dbac9e5fffb4721552f76f6fb981713a0","last_reissued_at":"2026-05-22T01:03:32.361237Z","signature_status":"signed_v1","first_computed_at":"2026-05-22T01:03:32.361237Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.21784","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-22T01:03:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0szFLvh4N52zqUuUyJQcgB0CoUTeB2rl2k9tjcNNqSvk3jBUfnD1iZRmKzqDlv9dv3+TwRdIeZsDOWaD3qK3Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T07:24:10.468039Z"},"content_sha256":"6c1e49a5d62cfe69a2132080ccfff88dbedfcce0d577b2cf58c6cea37a9c0505","schema_version":"1.0","event_id":"sha256:6c1e49a5d62cfe69a2132080ccfff88dbedfcce0d577b2cf58c6cea37a9c0505"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:2ZBC27GUI6G5JKMNUX2KCBRBHW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Constructions of Rank-Metric Codes of Small Tensor Rank","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AG","math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Eimear Byrne, Giuseppe Cotardo, Matteo Bonini","submitted_at":"2026-05-20T22:23:06Z","abstract_excerpt":"Rank-metric codes are subspaces of matrices over finite fields endowed with the rank metric and admit a natural tensorial representation. The tensor rank provides a measure of the minimal size of a decomposition of a code into rank-one tensors. Kruskal showed that the tensor rank of a rank-metric code of dimension $k$ and minimum rank distance $d$ is at least $k + d - 1$, and codes meeting this bound with equality are called minimal tensor rank (MTR) codes. It is known from algebraic complexity theory that the existence of an MTR code implies the existence of a maximum distance separable (MDS)"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.21784","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/2605.21784/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-05-22T01:03:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"InaICxnC4ITyymeaI7t4D8+m+Gxm3YWBWTfehHQSaT6dkW9Ah2WU/6eov/MnWTQj+WoudEbArQqmG2CGqhtABg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T07:24:10.468442Z"},"content_sha256":"557c4cbc2f9693c138c7706ba2877ae106f9084c6b69e0c49ec02515618745a3","schema_version":"1.0","event_id":"sha256:557c4cbc2f9693c138c7706ba2877ae106f9084c6b69e0c49ec02515618745a3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2ZBC27GUI6G5JKMNUX2KCBRBHW/bundle.json","state_url":"https://pith.science/pith/2ZBC27GUI6G5JKMNUX2KCBRBHW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2ZBC27GUI6G5JKMNUX2KCBRBHW/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-06-03T07:24:10Z","links":{"resolver":"https://pith.science/pith/2ZBC27GUI6G5JKMNUX2KCBRBHW","bundle":"https://pith.science/pith/2ZBC27GUI6G5JKMNUX2KCBRBHW/bundle.json","state":"https://pith.science/pith/2ZBC27GUI6G5JKMNUX2KCBRBHW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2ZBC27GUI6G5JKMNUX2KCBRBHW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:2ZBC27GUI6G5JKMNUX2KCBRBHW","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":"f79061bdf71c189ddfe27e1de549c9e51a6702255ec0b54c6cf30e18418334b1","cross_cats_sorted":["math.AG","math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-05-20T22:23:06Z","title_canon_sha256":"b4fc4ac66236d7afe53c1fdc4d6ead33a68246ce8d7f6097d5976290bfb9be0c"},"schema_version":"1.0","source":{"id":"2605.21784","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.21784","created_at":"2026-05-22T01:03:32Z"},{"alias_kind":"arxiv_version","alias_value":"2605.21784v1","created_at":"2026-05-22T01:03:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.21784","created_at":"2026-05-22T01:03:32Z"},{"alias_kind":"pith_short_12","alias_value":"2ZBC27GUI6G5","created_at":"2026-05-22T01:03:32Z"},{"alias_kind":"pith_short_16","alias_value":"2ZBC27GUI6G5JKMN","created_at":"2026-05-22T01:03:32Z"},{"alias_kind":"pith_short_8","alias_value":"2ZBC27GU","created_at":"2026-05-22T01:03:32Z"}],"graph_snapshots":[{"event_id":"sha256:557c4cbc2f9693c138c7706ba2877ae106f9084c6b69e0c49ec02515618745a3","target":"graph","created_at":"2026-05-22T01:03:32Z","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/2605.21784/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Rank-metric codes are subspaces of matrices over finite fields endowed with the rank metric and admit a natural tensorial representation. The tensor rank provides a measure of the minimal size of a decomposition of a code into rank-one tensors. Kruskal showed that the tensor rank of a rank-metric code of dimension $k$ and minimum rank distance $d$ is at least $k + d - 1$, and codes meeting this bound with equality are called minimal tensor rank (MTR) codes. It is known from algebraic complexity theory that the existence of an MTR code implies the existence of a maximum distance separable (MDS)","authors_text":"Eimear Byrne, Giuseppe Cotardo, Matteo Bonini","cross_cats":["math.AG","math.CO","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-05-20T22:23:06Z","title":"Constructions of Rank-Metric Codes of Small Tensor Rank"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.21784","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:6c1e49a5d62cfe69a2132080ccfff88dbedfcce0d577b2cf58c6cea37a9c0505","target":"record","created_at":"2026-05-22T01:03:32Z","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":"f79061bdf71c189ddfe27e1de549c9e51a6702255ec0b54c6cf30e18418334b1","cross_cats_sorted":["math.AG","math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-05-20T22:23:06Z","title_canon_sha256":"b4fc4ac66236d7afe53c1fdc4d6ead33a68246ce8d7f6097d5976290bfb9be0c"},"schema_version":"1.0","source":{"id":"2605.21784","kind":"arxiv","version":1}},"canonical_sha256":"d6422d7cd4478dd4a98da5f4a106213dbac9e5fffb4721552f76f6fb981713a0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d6422d7cd4478dd4a98da5f4a106213dbac9e5fffb4721552f76f6fb981713a0","first_computed_at":"2026-05-22T01:03:32.361237Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-22T01:03:32.361237Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VH21Iv3UaDslM0z+5ueH7QD3K9wpoYxX2dyEvu0P0UE1lY497sC6TlgX9W++SvBA+Cbxa74C/YGL4pG3E1gYBQ==","signature_status":"signed_v1","signed_at":"2026-05-22T01:03:32.361835Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.21784","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6c1e49a5d62cfe69a2132080ccfff88dbedfcce0d577b2cf58c6cea37a9c0505","sha256:557c4cbc2f9693c138c7706ba2877ae106f9084c6b69e0c49ec02515618745a3"],"state_sha256":"dd5b4375b4610f6b4441ed72ba00570a2ba66ddc85147441f3bc260d71e6c624"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oWaupyWrFcRmOgfTbvF5oYCigm2JNCjn4cve5iz3bqqrjTTTtzAtodxJ+8MR6fvdwWlKfZEXvnRUpH8JF6kJCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T07:24:10.470531Z","bundle_sha256":"6569eda8635fdb0924c72bc0b48624d5e490b3f36a542e88432e018ee65d90f1"}}