{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:VXVYZGLT3QTUGWLKHGJFCAS6QY","short_pith_number":"pith:VXVYZGLT","canonical_record":{"source":{"id":"1411.0724","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-11-03T22:33:25Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b6f58afec5de6c27c359e873d4eaeefa29f290b137691e4293d7354a3fcb1e38","abstract_canon_sha256":"f537f94d7e1c3eeb19d1e8d2a0ae3df22110f562308cc282ac10b39f46db2364"},"schema_version":"1.0"},"canonical_sha256":"adeb8c9973dc2743596a399251025e861ec2f34c36f6f7d4ea2201d69646c479","source":{"kind":"arxiv","id":"1411.0724","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.0724","created_at":"2026-05-18T02:26:52Z"},{"alias_kind":"arxiv_version","alias_value":"1411.0724v2","created_at":"2026-05-18T02:26:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.0724","created_at":"2026-05-18T02:26:52Z"},{"alias_kind":"pith_short_12","alias_value":"VXVYZGLT3QTU","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"VXVYZGLT3QTUGWLK","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"VXVYZGLT","created_at":"2026-05-18T12:28:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:VXVYZGLT3QTUGWLKHGJFCAS6QY","target":"record","payload":{"canonical_record":{"source":{"id":"1411.0724","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-11-03T22:33:25Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b6f58afec5de6c27c359e873d4eaeefa29f290b137691e4293d7354a3fcb1e38","abstract_canon_sha256":"f537f94d7e1c3eeb19d1e8d2a0ae3df22110f562308cc282ac10b39f46db2364"},"schema_version":"1.0"},"canonical_sha256":"adeb8c9973dc2743596a399251025e861ec2f34c36f6f7d4ea2201d69646c479","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:26:52.728831Z","signature_b64":"Dvn9Yg933nADJB12Zb7Gj3Iw0Bdzv/3Vdo6INeraSRhVT1F/BH5tXXD6PB2+3XudOAti0rgmGUKIjNenc501Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"adeb8c9973dc2743596a399251025e861ec2f34c36f6f7d4ea2201d69646c479","last_reissued_at":"2026-05-18T02:26:52.728403Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:26:52.728403Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1411.0724","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-18T02:26:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9Dcbyh8Hp3I3UaoufoPTxo+VDI35TYhyVpeOT8CAHBdamGjG0F+VVd+ETsOG/lr2Xb/wDdoKmewGlZABINdJCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T19:18:46.087109Z"},"content_sha256":"d12a4560791511953088ae74c8298a6a731c3425e542ebd2b9507610a57956f6","schema_version":"1.0","event_id":"sha256:d12a4560791511953088ae74c8298a6a731c3425e542ebd2b9507610a57956f6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:VXVYZGLT3QTUGWLKHGJFCAS6QY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bounds for complexity of syndrome decoding for poset metrics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jerry Anderson Pinheiro, Marcelo Firer","submitted_at":"2014-11-03T22:33:25Z","abstract_excerpt":"In this work we show how to decompose a linear code relatively to any given poset metric. We prove that the complexity of syndrome decoding is determined by a maximal (primary) such decomposition and then show that a refinement of a partial order leads to a refinement of the primary decomposition. Using this and considering already known results about hierarchical posets, we can establish upper and lower bounds for the complexity of syndrome decoding relatively to a poset metric."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.0724","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-18T02:26:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4aUZYuiwpfxqVSfSHm29CDWOBdeHfV+zsmI57RP7Gq8x86cx/mM39eF8rowmwkUVQYWi/o5RTmoemRYn+eJJAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T19:18:46.087476Z"},"content_sha256":"5716a1a935e24388fba3834819cabbe7f4ad2f07a730dcc1e3200f2fb5260e98","schema_version":"1.0","event_id":"sha256:5716a1a935e24388fba3834819cabbe7f4ad2f07a730dcc1e3200f2fb5260e98"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VXVYZGLT3QTUGWLKHGJFCAS6QY/bundle.json","state_url":"https://pith.science/pith/VXVYZGLT3QTUGWLKHGJFCAS6QY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VXVYZGLT3QTUGWLKHGJFCAS6QY/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-20T19:18:46Z","links":{"resolver":"https://pith.science/pith/VXVYZGLT3QTUGWLKHGJFCAS6QY","bundle":"https://pith.science/pith/VXVYZGLT3QTUGWLKHGJFCAS6QY/bundle.json","state":"https://pith.science/pith/VXVYZGLT3QTUGWLKHGJFCAS6QY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VXVYZGLT3QTUGWLKHGJFCAS6QY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:VXVYZGLT3QTUGWLKHGJFCAS6QY","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":"f537f94d7e1c3eeb19d1e8d2a0ae3df22110f562308cc282ac10b39f46db2364","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-11-03T22:33:25Z","title_canon_sha256":"b6f58afec5de6c27c359e873d4eaeefa29f290b137691e4293d7354a3fcb1e38"},"schema_version":"1.0","source":{"id":"1411.0724","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.0724","created_at":"2026-05-18T02:26:52Z"},{"alias_kind":"arxiv_version","alias_value":"1411.0724v2","created_at":"2026-05-18T02:26:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.0724","created_at":"2026-05-18T02:26:52Z"},{"alias_kind":"pith_short_12","alias_value":"VXVYZGLT3QTU","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"VXVYZGLT3QTUGWLK","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"VXVYZGLT","created_at":"2026-05-18T12:28:54Z"}],"graph_snapshots":[{"event_id":"sha256:5716a1a935e24388fba3834819cabbe7f4ad2f07a730dcc1e3200f2fb5260e98","target":"graph","created_at":"2026-05-18T02:26:52Z","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":"In this work we show how to decompose a linear code relatively to any given poset metric. We prove that the complexity of syndrome decoding is determined by a maximal (primary) such decomposition and then show that a refinement of a partial order leads to a refinement of the primary decomposition. Using this and considering already known results about hierarchical posets, we can establish upper and lower bounds for the complexity of syndrome decoding relatively to a poset metric.","authors_text":"Jerry Anderson Pinheiro, Marcelo Firer","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-11-03T22:33:25Z","title":"Bounds for complexity of syndrome decoding for poset metrics"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.0724","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:d12a4560791511953088ae74c8298a6a731c3425e542ebd2b9507610a57956f6","target":"record","created_at":"2026-05-18T02:26:52Z","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":"f537f94d7e1c3eeb19d1e8d2a0ae3df22110f562308cc282ac10b39f46db2364","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-11-03T22:33:25Z","title_canon_sha256":"b6f58afec5de6c27c359e873d4eaeefa29f290b137691e4293d7354a3fcb1e38"},"schema_version":"1.0","source":{"id":"1411.0724","kind":"arxiv","version":2}},"canonical_sha256":"adeb8c9973dc2743596a399251025e861ec2f34c36f6f7d4ea2201d69646c479","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"adeb8c9973dc2743596a399251025e861ec2f34c36f6f7d4ea2201d69646c479","first_computed_at":"2026-05-18T02:26:52.728403Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:26:52.728403Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Dvn9Yg933nADJB12Zb7Gj3Iw0Bdzv/3Vdo6INeraSRhVT1F/BH5tXXD6PB2+3XudOAti0rgmGUKIjNenc501Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:26:52.728831Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.0724","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d12a4560791511953088ae74c8298a6a731c3425e542ebd2b9507610a57956f6","sha256:5716a1a935e24388fba3834819cabbe7f4ad2f07a730dcc1e3200f2fb5260e98"],"state_sha256":"3415256d8e46dbfb3fb515922aaba50dc1b1eaacca98a6c25ab9f4d46ae1fa76"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GZACiXbiQ5D8Qg7bx/yO70arkkl5wDDIisllNra2CVq3rGyZd2SYTaZr2jQ+0Nb7MeM3s/ujgA/d0n9UpFzxAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T19:18:46.089410Z","bundle_sha256":"eff9b66a71bb09d1f7f8b457430d1e9e80ee48ecde29b803a10442a1caae23bd"}}