{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:VXVYZGLT3QTUGWLKHGJFCAS6QY","short_pith_number":"pith:VXVYZGLT","schema_version":"1.0","canonical_sha256":"adeb8c9973dc2743596a399251025e861ec2f34c36f6f7d4ea2201d69646c479","source":{"kind":"arxiv","id":"1411.0724","version":2},"attestation_state":"computed","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."},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1411.0724","created_at":"2026-05-18T02:26:52.728475+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.0724v2","created_at":"2026-05-18T02:26:52.728475+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.0724","created_at":"2026-05-18T02:26:52.728475+00:00"},{"alias_kind":"pith_short_12","alias_value":"VXVYZGLT3QTU","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_16","alias_value":"VXVYZGLT3QTUGWLK","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_8","alias_value":"VXVYZGLT","created_at":"2026-05-18T12:28:54.890064+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/VXVYZGLT3QTUGWLKHGJFCAS6QY","json":"https://pith.science/pith/VXVYZGLT3QTUGWLKHGJFCAS6QY.json","graph_json":"https://pith.science/api/pith-number/VXVYZGLT3QTUGWLKHGJFCAS6QY/graph.json","events_json":"https://pith.science/api/pith-number/VXVYZGLT3QTUGWLKHGJFCAS6QY/events.json","paper":"https://pith.science/paper/VXVYZGLT"},"agent_actions":{"view_html":"https://pith.science/pith/VXVYZGLT3QTUGWLKHGJFCAS6QY","download_json":"https://pith.science/pith/VXVYZGLT3QTUGWLKHGJFCAS6QY.json","view_paper":"https://pith.science/paper/VXVYZGLT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.0724&json=true","fetch_graph":"https://pith.science/api/pith-number/VXVYZGLT3QTUGWLKHGJFCAS6QY/graph.json","fetch_events":"https://pith.science/api/pith-number/VXVYZGLT3QTUGWLKHGJFCAS6QY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VXVYZGLT3QTUGWLKHGJFCAS6QY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VXVYZGLT3QTUGWLKHGJFCAS6QY/action/storage_attestation","attest_author":"https://pith.science/pith/VXVYZGLT3QTUGWLKHGJFCAS6QY/action/author_attestation","sign_citation":"https://pith.science/pith/VXVYZGLT3QTUGWLKHGJFCAS6QY/action/citation_signature","submit_replication":"https://pith.science/pith/VXVYZGLT3QTUGWLKHGJFCAS6QY/action/replication_record"}},"created_at":"2026-05-18T02:26:52.728475+00:00","updated_at":"2026-05-18T02:26:52.728475+00:00"}