{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:GTMJGGIXELSNTOOZYOWD7NLNVU","short_pith_number":"pith:GTMJGGIX","canonical_record":{"source":{"id":"1512.01839","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-12-06T21:43:56Z","cross_cats_sorted":["cs.DM","math.IT"],"title_canon_sha256":"41c4b10478bb2e3e90c8f589c55aa1eae1a6d4a57dc7d3cf6d3450440d21191f","abstract_canon_sha256":"144580d4c475da4aaa4bfb530a21253aa5979b24f7d4a637753b60a61f528e9f"},"schema_version":"1.0"},"canonical_sha256":"34d893191722e4d9b9d9c3ac3fb56dad243f5886cd7dd1208d3bbb41410f28c4","source":{"kind":"arxiv","id":"1512.01839","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.01839","created_at":"2026-05-18T01:15:57Z"},{"alias_kind":"arxiv_version","alias_value":"1512.01839v2","created_at":"2026-05-18T01:15:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.01839","created_at":"2026-05-18T01:15:57Z"},{"alias_kind":"pith_short_12","alias_value":"GTMJGGIXELSN","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"GTMJGGIXELSNTOOZ","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"GTMJGGIX","created_at":"2026-05-18T12:29:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:GTMJGGIXELSNTOOZYOWD7NLNVU","target":"record","payload":{"canonical_record":{"source":{"id":"1512.01839","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-12-06T21:43:56Z","cross_cats_sorted":["cs.DM","math.IT"],"title_canon_sha256":"41c4b10478bb2e3e90c8f589c55aa1eae1a6d4a57dc7d3cf6d3450440d21191f","abstract_canon_sha256":"144580d4c475da4aaa4bfb530a21253aa5979b24f7d4a637753b60a61f528e9f"},"schema_version":"1.0"},"canonical_sha256":"34d893191722e4d9b9d9c3ac3fb56dad243f5886cd7dd1208d3bbb41410f28c4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:57.830049Z","signature_b64":"Kbw/WQFTKoUw1p27+CRGEBOMFaXo1ohqcga0ihwFGJaOhAfcgUwHbIVtLULOHfpkGOZvl4nxoz3baP3mVW9SAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"34d893191722e4d9b9d9c3ac3fb56dad243f5886cd7dd1208d3bbb41410f28c4","last_reissued_at":"2026-05-18T01:15:57.829344Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:57.829344Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1512.01839","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-18T01:15:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A/NVUlXI8fFOEmg8UbkpxD/zUpFVgRfeJ1Q8eXp1LtUHNspjtHvioGuripf3aUtHM0vFrwzs9GzwWoHfxHIuDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T14:09:51.359024Z"},"content_sha256":"b2bf1fc72d51956a1ae3e13d2025af0dbc241bc610bbd6bb6e1323e728d76913","schema_version":"1.0","event_id":"sha256:b2bf1fc72d51956a1ae3e13d2025af0dbc241bc610bbd6bb6e1323e728d76913"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:GTMJGGIXELSNTOOZYOWD7NLNVU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Partial permutation decoding for binary linear and Z4-linear Hadamard codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.IT"],"primary_cat":"cs.IT","authors_text":"Merc\\`e Villanueva, Roland D. Barrolleta","submitted_at":"2015-12-06T21:43:56Z","abstract_excerpt":"Permutation decoding is a technique which involves finding a subset $S$, called PD-set, of the permutation automorphism group of a code $C$ in order to assist in decoding. An explicit construction of $\\left \\lfloor{\\frac{2^m-m-1}{1+m}} \\right \\rfloor$-PD-sets of minimum size $\\left \\lfloor{\\frac{2^m-m-1}{1+m}} \\right \\rfloor + 1$ for partial permutation decoding for binary linear Hadamard codes $H_m$ of length $2^m$, for all $m\\geq 4$, is described. Moreover, a recursive construction to obtain $s$-PD-sets of size $l$ for $H_{m+1}$ of length $2^{m+1}$, from a given $s$-PD-set of the same size f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.01839","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-18T01:15:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YahitCNRyYpmWpEVjRL5PPSaNlO9nsXnNe4sdbBToAbC3OnI25Q+5lMhcGtpJnBoYTGTxtnQL4znEBQrN2BABg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T14:09:51.359394Z"},"content_sha256":"6aac3b60a7996f54cf1855c601398a0f30c843d6bdf66b2b3de2284b914f2511","schema_version":"1.0","event_id":"sha256:6aac3b60a7996f54cf1855c601398a0f30c843d6bdf66b2b3de2284b914f2511"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GTMJGGIXELSNTOOZYOWD7NLNVU/bundle.json","state_url":"https://pith.science/pith/GTMJGGIXELSNTOOZYOWD7NLNVU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GTMJGGIXELSNTOOZYOWD7NLNVU/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-23T14:09:51Z","links":{"resolver":"https://pith.science/pith/GTMJGGIXELSNTOOZYOWD7NLNVU","bundle":"https://pith.science/pith/GTMJGGIXELSNTOOZYOWD7NLNVU/bundle.json","state":"https://pith.science/pith/GTMJGGIXELSNTOOZYOWD7NLNVU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GTMJGGIXELSNTOOZYOWD7NLNVU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:GTMJGGIXELSNTOOZYOWD7NLNVU","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":"144580d4c475da4aaa4bfb530a21253aa5979b24f7d4a637753b60a61f528e9f","cross_cats_sorted":["cs.DM","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-12-06T21:43:56Z","title_canon_sha256":"41c4b10478bb2e3e90c8f589c55aa1eae1a6d4a57dc7d3cf6d3450440d21191f"},"schema_version":"1.0","source":{"id":"1512.01839","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.01839","created_at":"2026-05-18T01:15:57Z"},{"alias_kind":"arxiv_version","alias_value":"1512.01839v2","created_at":"2026-05-18T01:15:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.01839","created_at":"2026-05-18T01:15:57Z"},{"alias_kind":"pith_short_12","alias_value":"GTMJGGIXELSN","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"GTMJGGIXELSNTOOZ","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"GTMJGGIX","created_at":"2026-05-18T12:29:22Z"}],"graph_snapshots":[{"event_id":"sha256:6aac3b60a7996f54cf1855c601398a0f30c843d6bdf66b2b3de2284b914f2511","target":"graph","created_at":"2026-05-18T01:15:57Z","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":"Permutation decoding is a technique which involves finding a subset $S$, called PD-set, of the permutation automorphism group of a code $C$ in order to assist in decoding. An explicit construction of $\\left \\lfloor{\\frac{2^m-m-1}{1+m}} \\right \\rfloor$-PD-sets of minimum size $\\left \\lfloor{\\frac{2^m-m-1}{1+m}} \\right \\rfloor + 1$ for partial permutation decoding for binary linear Hadamard codes $H_m$ of length $2^m$, for all $m\\geq 4$, is described. Moreover, a recursive construction to obtain $s$-PD-sets of size $l$ for $H_{m+1}$ of length $2^{m+1}$, from a given $s$-PD-set of the same size f","authors_text":"Merc\\`e Villanueva, Roland D. Barrolleta","cross_cats":["cs.DM","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-12-06T21:43:56Z","title":"Partial permutation decoding for binary linear and Z4-linear Hadamard codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.01839","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:b2bf1fc72d51956a1ae3e13d2025af0dbc241bc610bbd6bb6e1323e728d76913","target":"record","created_at":"2026-05-18T01:15:57Z","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":"144580d4c475da4aaa4bfb530a21253aa5979b24f7d4a637753b60a61f528e9f","cross_cats_sorted":["cs.DM","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-12-06T21:43:56Z","title_canon_sha256":"41c4b10478bb2e3e90c8f589c55aa1eae1a6d4a57dc7d3cf6d3450440d21191f"},"schema_version":"1.0","source":{"id":"1512.01839","kind":"arxiv","version":2}},"canonical_sha256":"34d893191722e4d9b9d9c3ac3fb56dad243f5886cd7dd1208d3bbb41410f28c4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"34d893191722e4d9b9d9c3ac3fb56dad243f5886cd7dd1208d3bbb41410f28c4","first_computed_at":"2026-05-18T01:15:57.829344Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:15:57.829344Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Kbw/WQFTKoUw1p27+CRGEBOMFaXo1ohqcga0ihwFGJaOhAfcgUwHbIVtLULOHfpkGOZvl4nxoz3baP3mVW9SAA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:15:57.830049Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.01839","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b2bf1fc72d51956a1ae3e13d2025af0dbc241bc610bbd6bb6e1323e728d76913","sha256:6aac3b60a7996f54cf1855c601398a0f30c843d6bdf66b2b3de2284b914f2511"],"state_sha256":"8f0bb50e9cc68402bd1c36c5ab275312287c1375f5f5568b941870a4da1ed127"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5laikbFeuPTWEziZAvvLxylXr70ujLSRklsGY13RkkYkcpiKCXFsR7CEVJXEmeK2/tNELj44MGLvYWJuEXH+DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T14:09:51.361393Z","bundle_sha256":"2fc6452c134f5984f6c7de975747888ad869909a86140ff5ddad32505b78749e"}}