{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:PDMZ4YLGSMYUPV5AAKBYC5FYFW","short_pith_number":"pith:PDMZ4YLG","canonical_record":{"source":{"id":"1904.01282","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-04-02T08:40:59Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"267c089fac36902bb6662c42abf634bfc6ddd71ac5420d81e8176f6780b5141c","abstract_canon_sha256":"641264f9fd9c5e8b2dad855f16a59d0132d382d2411bd978820c30703aef45de"},"schema_version":"1.0"},"canonical_sha256":"78d99e6166933147d7a002838174b82da0d5a42b3941f496f18c3a3723ffe4e6","source":{"kind":"arxiv","id":"1904.01282","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.01282","created_at":"2026-05-17T23:49:35Z"},{"alias_kind":"arxiv_version","alias_value":"1904.01282v1","created_at":"2026-05-17T23:49:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.01282","created_at":"2026-05-17T23:49:35Z"},{"alias_kind":"pith_short_12","alias_value":"PDMZ4YLGSMYU","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"PDMZ4YLGSMYUPV5A","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"PDMZ4YLG","created_at":"2026-05-18T12:33:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:PDMZ4YLGSMYUPV5AAKBYC5FYFW","target":"record","payload":{"canonical_record":{"source":{"id":"1904.01282","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-04-02T08:40:59Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"267c089fac36902bb6662c42abf634bfc6ddd71ac5420d81e8176f6780b5141c","abstract_canon_sha256":"641264f9fd9c5e8b2dad855f16a59d0132d382d2411bd978820c30703aef45de"},"schema_version":"1.0"},"canonical_sha256":"78d99e6166933147d7a002838174b82da0d5a42b3941f496f18c3a3723ffe4e6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:49:35.280330Z","signature_b64":"n8GkgvUaKvRfy3FXehRzzwqP3oL+v6odMvsdYCwuUxN2PfpzFKwDrxmudzil+pZL1bNF22bIhiJNE56WGpKsCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"78d99e6166933147d7a002838174b82da0d5a42b3941f496f18c3a3723ffe4e6","last_reissued_at":"2026-05-17T23:49:35.279407Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:49:35.279407Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1904.01282","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-17T23:49:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vsyAXHpKzozG0YuVhGE8vtT1PfyAZ2rEGAffrekgWPD7ENnctV+DV6ZVqVBMPOtoja4rS4NhZ7vQsnroMLl5Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T23:01:30.101707Z"},"content_sha256":"9d807fd3431bdb611bade3fc6d6e4b745e732398a0407c81ef68069fce389499","schema_version":"1.0","event_id":"sha256:9d807fd3431bdb611bade3fc6d6e4b745e732398a0407c81ef68069fce389499"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:PDMZ4YLGSMYUPV5AAKBYC5FYFW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On transitive uniform partitions of F^n into binary Hamming codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Faina I. Solov'eva","submitted_at":"2019-04-02T08:40:59Z","abstract_excerpt":"We investigate transitive uniform partitions of the vector space $F^n$ of dimension $n$ over the Galois field $GF(2)$ into cosets of Hamming codes. A partition $P^n= \\{H_0,H_1+e_1,\\ldots,H_n+e_n\\}$ of $F^n$ into cosets of Hamming codes $H_0,H_1,\\ldots,H_n$ of length $n$ is said to be uniform if the intersection of any two codes $H_i$ and $H_j$, $i,j\\in \\{0,1,\\ldots,n \\}$ is constant, here $e_i$ is a binary vector in $F^n$ of weight $1$ with one in the $i$th coordinate position.\n  For any $n=2^m-1$, $m>4$ we found a class of nonequivalent $2$-transitive uniform partitions of $F^n$ into cosets o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.01282","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":""},"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-17T23:49:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"438sW2jIeeYffsKlYoUWTFaiOM668MCNRrIBmYIUa9E43/fRFhU96WN3+6HKN0Sh/OQvprSxHH1k5qsHTMOjCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T23:01:30.102107Z"},"content_sha256":"39d2f5582c01d0ead1fff3821306f68774d33c5df39d64f234a0245c11c0087c","schema_version":"1.0","event_id":"sha256:39d2f5582c01d0ead1fff3821306f68774d33c5df39d64f234a0245c11c0087c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PDMZ4YLGSMYUPV5AAKBYC5FYFW/bundle.json","state_url":"https://pith.science/pith/PDMZ4YLGSMYUPV5AAKBYC5FYFW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PDMZ4YLGSMYUPV5AAKBYC5FYFW/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-20T23:01:30Z","links":{"resolver":"https://pith.science/pith/PDMZ4YLGSMYUPV5AAKBYC5FYFW","bundle":"https://pith.science/pith/PDMZ4YLGSMYUPV5AAKBYC5FYFW/bundle.json","state":"https://pith.science/pith/PDMZ4YLGSMYUPV5AAKBYC5FYFW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PDMZ4YLGSMYUPV5AAKBYC5FYFW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:PDMZ4YLGSMYUPV5AAKBYC5FYFW","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":"641264f9fd9c5e8b2dad855f16a59d0132d382d2411bd978820c30703aef45de","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-04-02T08:40:59Z","title_canon_sha256":"267c089fac36902bb6662c42abf634bfc6ddd71ac5420d81e8176f6780b5141c"},"schema_version":"1.0","source":{"id":"1904.01282","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.01282","created_at":"2026-05-17T23:49:35Z"},{"alias_kind":"arxiv_version","alias_value":"1904.01282v1","created_at":"2026-05-17T23:49:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.01282","created_at":"2026-05-17T23:49:35Z"},{"alias_kind":"pith_short_12","alias_value":"PDMZ4YLGSMYU","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"PDMZ4YLGSMYUPV5A","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"PDMZ4YLG","created_at":"2026-05-18T12:33:24Z"}],"graph_snapshots":[{"event_id":"sha256:39d2f5582c01d0ead1fff3821306f68774d33c5df39d64f234a0245c11c0087c","target":"graph","created_at":"2026-05-17T23:49:35Z","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":"We investigate transitive uniform partitions of the vector space $F^n$ of dimension $n$ over the Galois field $GF(2)$ into cosets of Hamming codes. A partition $P^n= \\{H_0,H_1+e_1,\\ldots,H_n+e_n\\}$ of $F^n$ into cosets of Hamming codes $H_0,H_1,\\ldots,H_n$ of length $n$ is said to be uniform if the intersection of any two codes $H_i$ and $H_j$, $i,j\\in \\{0,1,\\ldots,n \\}$ is constant, here $e_i$ is a binary vector in $F^n$ of weight $1$ with one in the $i$th coordinate position.\n  For any $n=2^m-1$, $m>4$ we found a class of nonequivalent $2$-transitive uniform partitions of $F^n$ into cosets o","authors_text":"Faina I. Solov'eva","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-04-02T08:40:59Z","title":"On transitive uniform partitions of F^n into binary Hamming codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.01282","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:9d807fd3431bdb611bade3fc6d6e4b745e732398a0407c81ef68069fce389499","target":"record","created_at":"2026-05-17T23:49:35Z","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":"641264f9fd9c5e8b2dad855f16a59d0132d382d2411bd978820c30703aef45de","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-04-02T08:40:59Z","title_canon_sha256":"267c089fac36902bb6662c42abf634bfc6ddd71ac5420d81e8176f6780b5141c"},"schema_version":"1.0","source":{"id":"1904.01282","kind":"arxiv","version":1}},"canonical_sha256":"78d99e6166933147d7a002838174b82da0d5a42b3941f496f18c3a3723ffe4e6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"78d99e6166933147d7a002838174b82da0d5a42b3941f496f18c3a3723ffe4e6","first_computed_at":"2026-05-17T23:49:35.279407Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:49:35.279407Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"n8GkgvUaKvRfy3FXehRzzwqP3oL+v6odMvsdYCwuUxN2PfpzFKwDrxmudzil+pZL1bNF22bIhiJNE56WGpKsCw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:49:35.280330Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.01282","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9d807fd3431bdb611bade3fc6d6e4b745e732398a0407c81ef68069fce389499","sha256:39d2f5582c01d0ead1fff3821306f68774d33c5df39d64f234a0245c11c0087c"],"state_sha256":"33cf7befa0ff07a633ec354cea336f54015733cc634cd9dd1769be5c00237817"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bRMUrd3SZhQ0QLgEkWWYN5On6PKjRaX2qCsmuPE1oQxl5vSiNQvvckYprZ79ORrzIQnlZ2r6Uk/NRuFbcONUCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T23:01:30.104271Z","bundle_sha256":"4116642aeb419a8ef7f83e9352c05c184e6c0de63a2e9b39586ffe5ced170600"}}