{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:GI55CBFLCY7H7MGH62267XTVLC","short_pith_number":"pith:GI55CBFL","canonical_record":{"source":{"id":"1908.02169","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-06T14:05:24Z","cross_cats_sorted":[],"title_canon_sha256":"a5ed230401fdae606c25a10f8feaf9efc4d6eb0834085a66a275bb125df7a928","abstract_canon_sha256":"4312fd6199be5dad350523f6b5076534e811c3626d4f9547ee741d6570798bf5"},"schema_version":"1.0"},"canonical_sha256":"323bd104ab163e7fb0c7f6b5efde75588aa855c024fdc29402f9458d83ebc309","source":{"kind":"arxiv","id":"1908.02169","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.02169","created_at":"2026-07-05T01:02:03Z"},{"alias_kind":"arxiv_version","alias_value":"1908.02169v1","created_at":"2026-07-05T01:02:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.02169","created_at":"2026-07-05T01:02:03Z"},{"alias_kind":"pith_short_12","alias_value":"GI55CBFLCY7H","created_at":"2026-07-05T01:02:03Z"},{"alias_kind":"pith_short_16","alias_value":"GI55CBFLCY7H7MGH","created_at":"2026-07-05T01:02:03Z"},{"alias_kind":"pith_short_8","alias_value":"GI55CBFL","created_at":"2026-07-05T01:02:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:GI55CBFLCY7H7MGH62267XTVLC","target":"record","payload":{"canonical_record":{"source":{"id":"1908.02169","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-06T14:05:24Z","cross_cats_sorted":[],"title_canon_sha256":"a5ed230401fdae606c25a10f8feaf9efc4d6eb0834085a66a275bb125df7a928","abstract_canon_sha256":"4312fd6199be5dad350523f6b5076534e811c3626d4f9547ee741d6570798bf5"},"schema_version":"1.0"},"canonical_sha256":"323bd104ab163e7fb0c7f6b5efde75588aa855c024fdc29402f9458d83ebc309","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:02:03.437358Z","signature_b64":"IRh8e9KfgjAN2hM6jiFk/VXXsDeclLSuHSF5O8SMhU0fylZGbxt8QvHZ7E1qP9467+uczYlTqPD5fzOfdg1UCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"323bd104ab163e7fb0c7f6b5efde75588aa855c024fdc29402f9458d83ebc309","last_reissued_at":"2026-07-05T01:02:03.436912Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:02:03.436912Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1908.02169","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-05T01:02:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2VTsvHpLuLggCXHV3RImBJyltAAuxUlziVM6YJvM2GcKHxv/DZWNOLOuhqFlfcI41hMh0G1VlrU1Q4UzhBY7BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T17:19:29.729363Z"},"content_sha256":"b53340365c88439c29f1196fdd8077f3834f1259c8226dcb2981d0fcfd749d13","schema_version":"1.0","event_id":"sha256:b53340365c88439c29f1196fdd8077f3834f1259c8226dcb2981d0fcfd749d13"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:GI55CBFLCY7H7MGH62267XTVLC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Automorphism groups and new constructions of maximum additive rank metric codes with restrictions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"G. Longobardi, G. Lunardon, R. Trombetti, Y. Zhou","submitted_at":"2019-08-06T14:05:24Z","abstract_excerpt":"Let $d, n \\in \\mathbb{Z}^+$ such that $1\\leq d \\leq n$. A $d$-code $\\mathcal{C} \\subset \\mathbb{F}_q^{n \\times n}$ is a subset of order $n$ square matrices with the property that for all pairs of distinct elements in $\\mathcal{C}$, the rank of their difference is greater than or equal to $d$. A $d$-code with as many as possible elements is called a maximum $d$-code. The integer $d$ is also called the minimum distance of the code. When $d<n$, a classical example of such an object is the so-called generalized Gabidulin code. There exist several classes of maximum $d$-codes made up respectively o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.02169","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.02169/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-05T01:02:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gMF149qzDmuM0KjSlst6RHu3YQMuxGEWO7OJUrO96edEWXBRgfi+T5QF42AyuA7KiQfAW6jyY7gUPtpmQu0PDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T17:19:29.729864Z"},"content_sha256":"da50e7a15b5df7af84e87f233c8257c6f7a540916cb2fb22c71003965e709950","schema_version":"1.0","event_id":"sha256:da50e7a15b5df7af84e87f233c8257c6f7a540916cb2fb22c71003965e709950"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GI55CBFLCY7H7MGH62267XTVLC/bundle.json","state_url":"https://pith.science/pith/GI55CBFLCY7H7MGH62267XTVLC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GI55CBFLCY7H7MGH62267XTVLC/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-16T17:19:29Z","links":{"resolver":"https://pith.science/pith/GI55CBFLCY7H7MGH62267XTVLC","bundle":"https://pith.science/pith/GI55CBFLCY7H7MGH62267XTVLC/bundle.json","state":"https://pith.science/pith/GI55CBFLCY7H7MGH62267XTVLC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GI55CBFLCY7H7MGH62267XTVLC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:GI55CBFLCY7H7MGH62267XTVLC","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":"4312fd6199be5dad350523f6b5076534e811c3626d4f9547ee741d6570798bf5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-06T14:05:24Z","title_canon_sha256":"a5ed230401fdae606c25a10f8feaf9efc4d6eb0834085a66a275bb125df7a928"},"schema_version":"1.0","source":{"id":"1908.02169","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.02169","created_at":"2026-07-05T01:02:03Z"},{"alias_kind":"arxiv_version","alias_value":"1908.02169v1","created_at":"2026-07-05T01:02:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.02169","created_at":"2026-07-05T01:02:03Z"},{"alias_kind":"pith_short_12","alias_value":"GI55CBFLCY7H","created_at":"2026-07-05T01:02:03Z"},{"alias_kind":"pith_short_16","alias_value":"GI55CBFLCY7H7MGH","created_at":"2026-07-05T01:02:03Z"},{"alias_kind":"pith_short_8","alias_value":"GI55CBFL","created_at":"2026-07-05T01:02:03Z"}],"graph_snapshots":[{"event_id":"sha256:da50e7a15b5df7af84e87f233c8257c6f7a540916cb2fb22c71003965e709950","target":"graph","created_at":"2026-07-05T01:02:03Z","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.02169/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Let $d, n \\in \\mathbb{Z}^+$ such that $1\\leq d \\leq n$. A $d$-code $\\mathcal{C} \\subset \\mathbb{F}_q^{n \\times n}$ is a subset of order $n$ square matrices with the property that for all pairs of distinct elements in $\\mathcal{C}$, the rank of their difference is greater than or equal to $d$. A $d$-code with as many as possible elements is called a maximum $d$-code. The integer $d$ is also called the minimum distance of the code. When $d<n$, a classical example of such an object is the so-called generalized Gabidulin code. There exist several classes of maximum $d$-codes made up respectively o","authors_text":"G. Longobardi, G. Lunardon, R. Trombetti, Y. Zhou","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-06T14:05:24Z","title":"Automorphism groups and new constructions of maximum additive rank metric codes with restrictions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.02169","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:b53340365c88439c29f1196fdd8077f3834f1259c8226dcb2981d0fcfd749d13","target":"record","created_at":"2026-07-05T01:02:03Z","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":"4312fd6199be5dad350523f6b5076534e811c3626d4f9547ee741d6570798bf5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-06T14:05:24Z","title_canon_sha256":"a5ed230401fdae606c25a10f8feaf9efc4d6eb0834085a66a275bb125df7a928"},"schema_version":"1.0","source":{"id":"1908.02169","kind":"arxiv","version":1}},"canonical_sha256":"323bd104ab163e7fb0c7f6b5efde75588aa855c024fdc29402f9458d83ebc309","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"323bd104ab163e7fb0c7f6b5efde75588aa855c024fdc29402f9458d83ebc309","first_computed_at":"2026-07-05T01:02:03.436912Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:02:03.436912Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IRh8e9KfgjAN2hM6jiFk/VXXsDeclLSuHSF5O8SMhU0fylZGbxt8QvHZ7E1qP9467+uczYlTqPD5fzOfdg1UCg==","signature_status":"signed_v1","signed_at":"2026-07-05T01:02:03.437358Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.02169","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b53340365c88439c29f1196fdd8077f3834f1259c8226dcb2981d0fcfd749d13","sha256:da50e7a15b5df7af84e87f233c8257c6f7a540916cb2fb22c71003965e709950"],"state_sha256":"edcd7986b8c5b01b3b328ec99ee242c5836fec4ac4592dd9e45d3de2eb313456"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BlURwM+5eRvYZpWb89NdDeturPgN264jlGOW1y2WGiCNEPAO7rpbuMfkx2yf8Co//8EHpGH9bawfiTQNkH5sCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T17:19:29.733930Z","bundle_sha256":"0f920bd8d5784801e1ed510d8d44353c3471de7302da570a9e27e46603638f23"}}