{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:UB5GWFSUPE6DBI6YJML362NAXT","short_pith_number":"pith:UB5GWFSU","schema_version":"1.0","canonical_sha256":"a07a6b1654793c30a3d84b17bf69a0bce6573ed651617d8ed348cf9c941c498b","source":{"kind":"arxiv","id":"1507.02184","version":4},"attestation_state":"computed","paper":{"title":"The \"art of trellis decoding\" is fixed-parameter tractable","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Eun Jung Kim, Jisu Jeong, Sang-il Oum","submitted_at":"2015-07-08T14:57:05Z","abstract_excerpt":"Given n subspaces of a finite-dimensional vector space over a fixed finite field $\\mathbb F$, we wish to find a linear layout $V_1,V_2,\\ldots,V_n$ of the subspaces such that $\\dim((V_1+V_2+\\cdots+V_i) \\cap (V_{i+1}+\\cdots+V_n))\\le k$ for all i, such a linear layout is said to have width at most k. When restricted to 1-dimensional subspaces, this problem is equivalent to computing the trellis-width (or minimum trellis state-complexity) of a linear code in coding theory and computing the path-width of an $\\mathbb F$-represented matroid in matroid theory.\n  We present a fixed-parameter tractable "},"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":"1507.02184","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-08T14:57:05Z","cross_cats_sorted":["cs.CC","cs.DM","math.CO"],"title_canon_sha256":"e4445e257340e1f971f29adba440c7b598bb9ad3c1cab30426f13d76f344f784","abstract_canon_sha256":"fa5307edb63d328826074372ae76368fef90726fff13b4703fd2eec35af96e0c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:03.380971Z","signature_b64":"S7ZSut8Mxb27vqKbcoWMwbPEr6q5Or8lpwh9PMrvquFr9Ym30UMASiD2FPyiUxmz7v9TeHKouwqQR798FbL/DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a07a6b1654793c30a3d84b17bf69a0bce6573ed651617d8ed348cf9c941c498b","last_reissued_at":"2026-05-18T00:16:03.380619Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:03.380619Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The \"art of trellis decoding\" is fixed-parameter tractable","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Eun Jung Kim, Jisu Jeong, Sang-il Oum","submitted_at":"2015-07-08T14:57:05Z","abstract_excerpt":"Given n subspaces of a finite-dimensional vector space over a fixed finite field $\\mathbb F$, we wish to find a linear layout $V_1,V_2,\\ldots,V_n$ of the subspaces such that $\\dim((V_1+V_2+\\cdots+V_i) \\cap (V_{i+1}+\\cdots+V_n))\\le k$ for all i, such a linear layout is said to have width at most k. When restricted to 1-dimensional subspaces, this problem is equivalent to computing the trellis-width (or minimum trellis state-complexity) of a linear code in coding theory and computing the path-width of an $\\mathbb F$-represented matroid in matroid theory.\n  We present a fixed-parameter tractable "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.02184","kind":"arxiv","version":4},"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":"1507.02184","created_at":"2026-05-18T00:16:03.380674+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.02184v4","created_at":"2026-05-18T00:16:03.380674+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.02184","created_at":"2026-05-18T00:16:03.380674+00:00"},{"alias_kind":"pith_short_12","alias_value":"UB5GWFSUPE6D","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_16","alias_value":"UB5GWFSUPE6DBI6Y","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_8","alias_value":"UB5GWFSU","created_at":"2026-05-18T12:29:44.643036+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/UB5GWFSUPE6DBI6YJML362NAXT","json":"https://pith.science/pith/UB5GWFSUPE6DBI6YJML362NAXT.json","graph_json":"https://pith.science/api/pith-number/UB5GWFSUPE6DBI6YJML362NAXT/graph.json","events_json":"https://pith.science/api/pith-number/UB5GWFSUPE6DBI6YJML362NAXT/events.json","paper":"https://pith.science/paper/UB5GWFSU"},"agent_actions":{"view_html":"https://pith.science/pith/UB5GWFSUPE6DBI6YJML362NAXT","download_json":"https://pith.science/pith/UB5GWFSUPE6DBI6YJML362NAXT.json","view_paper":"https://pith.science/paper/UB5GWFSU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.02184&json=true","fetch_graph":"https://pith.science/api/pith-number/UB5GWFSUPE6DBI6YJML362NAXT/graph.json","fetch_events":"https://pith.science/api/pith-number/UB5GWFSUPE6DBI6YJML362NAXT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UB5GWFSUPE6DBI6YJML362NAXT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UB5GWFSUPE6DBI6YJML362NAXT/action/storage_attestation","attest_author":"https://pith.science/pith/UB5GWFSUPE6DBI6YJML362NAXT/action/author_attestation","sign_citation":"https://pith.science/pith/UB5GWFSUPE6DBI6YJML362NAXT/action/citation_signature","submit_replication":"https://pith.science/pith/UB5GWFSUPE6DBI6YJML362NAXT/action/replication_record"}},"created_at":"2026-05-18T00:16:03.380674+00:00","updated_at":"2026-05-18T00:16:03.380674+00:00"}