{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:QWI4AEXI73B32VAK4N4K6GYI3O","short_pith_number":"pith:QWI4AEXI","schema_version":"1.0","canonical_sha256":"8591c012e8fec3bd540ae378af1b08dbac45fe5fd81a4c03ee5ea305a1873ce9","source":{"kind":"arxiv","id":"1305.5765","version":2},"attestation_state":"computed","paper":{"title":"Gray codes and Enumerative Coding for vector spaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Moshe Schwartz","submitted_at":"2013-05-24T15:15:08Z","abstract_excerpt":"Gray codes for vector spaces are considered in two graphs: the Grassmann graph, and the projective-space graph, both of which have recently found applications in network coding. For the Grassmann graph, constructions of cyclic optimal codes are given for all parameters. As for the projective-space graph, two constructions for specific parameters are provided, as well some non-existence results.\n  Furthermore, encoding and decoding algorithms are given for the Grassmannian Gray code, which induce an enumerative-coding scheme. The computational complexity of the algorithms is at least as low as "},"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":"1305.5765","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-24T15:15:08Z","cross_cats_sorted":["math.CO","math.IT"],"title_canon_sha256":"4d0c1c181a92145b4fe1f3fcd577638da436e5768f8cdadd0a964833074018e0","abstract_canon_sha256":"7e30e919da7c4ddebd2de5a2787ff92bb4f3d38aca3dee4ceb4d9e84208d452e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:21:11.483581Z","signature_b64":"F03JiOjAWljjTeNITIQSZ4BbBslX0L2Y9dJVRJeXzcdMAyQuPsN8KXB9FC4U6TsY0YNVePlhid2NRi+92LC0BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8591c012e8fec3bd540ae378af1b08dbac45fe5fd81a4c03ee5ea305a1873ce9","last_reissued_at":"2026-05-18T03:21:11.482795Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:21:11.482795Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Gray codes and Enumerative Coding for vector spaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Moshe Schwartz","submitted_at":"2013-05-24T15:15:08Z","abstract_excerpt":"Gray codes for vector spaces are considered in two graphs: the Grassmann graph, and the projective-space graph, both of which have recently found applications in network coding. For the Grassmann graph, constructions of cyclic optimal codes are given for all parameters. As for the projective-space graph, two constructions for specific parameters are provided, as well some non-existence results.\n  Furthermore, encoding and decoding algorithms are given for the Grassmannian Gray code, which induce an enumerative-coding scheme. The computational complexity of the algorithms is at least as low as "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.5765","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1305.5765","created_at":"2026-05-18T03:21:11.482930+00:00"},{"alias_kind":"arxiv_version","alias_value":"1305.5765v2","created_at":"2026-05-18T03:21:11.482930+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.5765","created_at":"2026-05-18T03:21:11.482930+00:00"},{"alias_kind":"pith_short_12","alias_value":"QWI4AEXI73B3","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_16","alias_value":"QWI4AEXI73B32VAK","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_8","alias_value":"QWI4AEXI","created_at":"2026-05-18T12:27:57.521954+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QWI4AEXI73B32VAK4N4K6GYI3O","json":"https://pith.science/pith/QWI4AEXI73B32VAK4N4K6GYI3O.json","graph_json":"https://pith.science/api/pith-number/QWI4AEXI73B32VAK4N4K6GYI3O/graph.json","events_json":"https://pith.science/api/pith-number/QWI4AEXI73B32VAK4N4K6GYI3O/events.json","paper":"https://pith.science/paper/QWI4AEXI"},"agent_actions":{"view_html":"https://pith.science/pith/QWI4AEXI73B32VAK4N4K6GYI3O","download_json":"https://pith.science/pith/QWI4AEXI73B32VAK4N4K6GYI3O.json","view_paper":"https://pith.science/paper/QWI4AEXI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1305.5765&json=true","fetch_graph":"https://pith.science/api/pith-number/QWI4AEXI73B32VAK4N4K6GYI3O/graph.json","fetch_events":"https://pith.science/api/pith-number/QWI4AEXI73B32VAK4N4K6GYI3O/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QWI4AEXI73B32VAK4N4K6GYI3O/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QWI4AEXI73B32VAK4N4K6GYI3O/action/storage_attestation","attest_author":"https://pith.science/pith/QWI4AEXI73B32VAK4N4K6GYI3O/action/author_attestation","sign_citation":"https://pith.science/pith/QWI4AEXI73B32VAK4N4K6GYI3O/action/citation_signature","submit_replication":"https://pith.science/pith/QWI4AEXI73B32VAK4N4K6GYI3O/action/replication_record"}},"created_at":"2026-05-18T03:21:11.482930+00:00","updated_at":"2026-05-18T03:21:11.482930+00:00"}