{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:QWI4AEXI73B32VAK4N4K6GYI3O","short_pith_number":"pith:QWI4AEXI","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"},"canonical_sha256":"8591c012e8fec3bd540ae378af1b08dbac45fe5fd81a4c03ee5ea305a1873ce9","source":{"kind":"arxiv","id":"1305.5765","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.5765","created_at":"2026-05-18T03:21:11Z"},{"alias_kind":"arxiv_version","alias_value":"1305.5765v2","created_at":"2026-05-18T03:21:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.5765","created_at":"2026-05-18T03:21:11Z"},{"alias_kind":"pith_short_12","alias_value":"QWI4AEXI73B3","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"QWI4AEXI73B32VAK","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"QWI4AEXI","created_at":"2026-05-18T12:27:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:QWI4AEXI73B32VAK4N4K6GYI3O","target":"record","payload":{"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"},"canonical_sha256":"8591c012e8fec3bd540ae378af1b08dbac45fe5fd81a4c03ee5ea305a1873ce9","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"},"source_kind":"arxiv","source_id":"1305.5765","source_version":2,"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-18T03:21:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MK3lMZHSERg4QxeySGSx+WKnYJGeekJT2VKK9oYAc+OgpXt28gSUSbVmzDVQdM91ChyDhMbWA3uZDUFb3mZcBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T02:03:52.362140Z"},"content_sha256":"94ca5a2f8dc63f2de9afba3ef43fea320d6c4844b55e80f94ed78b69b01e6442","schema_version":"1.0","event_id":"sha256:94ca5a2f8dc63f2de9afba3ef43fea320d6c4844b55e80f94ed78b69b01e6442"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:QWI4AEXI73B32VAK4N4K6GYI3O","target":"graph","payload":{"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"},"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-18T03:21:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8mT45qQHCNA4V2+k7Xp5ylLXigSNlZSZqsdout7mmOZo57ZAY1nEiBR92bMwg5uvrH16c8lgj8v/7sw/BT/kBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T02:03:52.362838Z"},"content_sha256":"cbb4629ca211f974e9203ea97c215b954fabd1c0b645f35cc1a8f1f5d6271b7c","schema_version":"1.0","event_id":"sha256:cbb4629ca211f974e9203ea97c215b954fabd1c0b645f35cc1a8f1f5d6271b7c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QWI4AEXI73B32VAK4N4K6GYI3O/bundle.json","state_url":"https://pith.science/pith/QWI4AEXI73B32VAK4N4K6GYI3O/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QWI4AEXI73B32VAK4N4K6GYI3O/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-12T02:03:52Z","links":{"resolver":"https://pith.science/pith/QWI4AEXI73B32VAK4N4K6GYI3O","bundle":"https://pith.science/pith/QWI4AEXI73B32VAK4N4K6GYI3O/bundle.json","state":"https://pith.science/pith/QWI4AEXI73B32VAK4N4K6GYI3O/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QWI4AEXI73B32VAK4N4K6GYI3O/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:QWI4AEXI73B32VAK4N4K6GYI3O","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":"7e30e919da7c4ddebd2de5a2787ff92bb4f3d38aca3dee4ceb4d9e84208d452e","cross_cats_sorted":["math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-24T15:15:08Z","title_canon_sha256":"4d0c1c181a92145b4fe1f3fcd577638da436e5768f8cdadd0a964833074018e0"},"schema_version":"1.0","source":{"id":"1305.5765","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.5765","created_at":"2026-05-18T03:21:11Z"},{"alias_kind":"arxiv_version","alias_value":"1305.5765v2","created_at":"2026-05-18T03:21:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.5765","created_at":"2026-05-18T03:21:11Z"},{"alias_kind":"pith_short_12","alias_value":"QWI4AEXI73B3","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"QWI4AEXI73B32VAK","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"QWI4AEXI","created_at":"2026-05-18T12:27:57Z"}],"graph_snapshots":[{"event_id":"sha256:cbb4629ca211f974e9203ea97c215b954fabd1c0b645f35cc1a8f1f5d6271b7c","target":"graph","created_at":"2026-05-18T03:21:11Z","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"},"paper":{"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 ","authors_text":"Moshe Schwartz","cross_cats":["math.CO","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-24T15:15:08Z","title":"Gray codes and Enumerative Coding for vector spaces"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.5765","kind":"arxiv","version":2},"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:94ca5a2f8dc63f2de9afba3ef43fea320d6c4844b55e80f94ed78b69b01e6442","target":"record","created_at":"2026-05-18T03:21:11Z","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":"7e30e919da7c4ddebd2de5a2787ff92bb4f3d38aca3dee4ceb4d9e84208d452e","cross_cats_sorted":["math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-24T15:15:08Z","title_canon_sha256":"4d0c1c181a92145b4fe1f3fcd577638da436e5768f8cdadd0a964833074018e0"},"schema_version":"1.0","source":{"id":"1305.5765","kind":"arxiv","version":2}},"canonical_sha256":"8591c012e8fec3bd540ae378af1b08dbac45fe5fd81a4c03ee5ea305a1873ce9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8591c012e8fec3bd540ae378af1b08dbac45fe5fd81a4c03ee5ea305a1873ce9","first_computed_at":"2026-05-18T03:21:11.482795Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:21:11.482795Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"F03JiOjAWljjTeNITIQSZ4BbBslX0L2Y9dJVRJeXzcdMAyQuPsN8KXB9FC4U6TsY0YNVePlhid2NRi+92LC0BA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:21:11.483581Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.5765","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:94ca5a2f8dc63f2de9afba3ef43fea320d6c4844b55e80f94ed78b69b01e6442","sha256:cbb4629ca211f974e9203ea97c215b954fabd1c0b645f35cc1a8f1f5d6271b7c"],"state_sha256":"94f57571a5c36ca374b0392d1b4fb2aec3377021dab2ebbdb4b97bb65dcd8371"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2GoCcAyXLv35mAHa5dAs0LWVu+oGXvMdK9C2Yb18MyMM1HlTtxq1ZH3AtG9s3/AJh2sM4iTWUUNdyTcfQtvFDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T02:03:52.366639Z","bundle_sha256":"ccc2c78cb1d886bf1dc10701adfa038b53d903770339de4ff5da8991d378a174"}}