{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:RLWWYJCCNUS25AGE7BMSFOAZOV","short_pith_number":"pith:RLWWYJCC","schema_version":"1.0","canonical_sha256":"8aed6c24426d25ae80c4f85922b819755dba6d3b80902113e1fff4c0eb0b85d7","source":{"kind":"arxiv","id":"0903.4237","version":2},"attestation_state":"computed","paper":{"title":"Projection-Forcing Multisets of Weight Changes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.CO","authors_text":"Josh Brown Kramer, Lucas Sabalka","submitted_at":"2009-03-25T05:10:36Z","abstract_excerpt":"Let $F$ be a finite field. A multiset $S$ of integers is projection-forcing if for every linear function $\\phi : F^n \\to F^m$ whose multiset of weight changes is $S$, $\\phi$ is a coordinate projection up to permutation and scaling of entries. The MacWilliams Extension Theorem from coding theory says that $S = \\{0, 0, ..., 0\\}$ is projection-forcing. We give a (super-polynomial) algorithm to determine whether or not a given $S$ is projection-forcing. We also give a condition that can be checked in polynomial time that implies that $S$ is projection-forcing. This result is a generalization of th"},"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":"0903.4237","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-03-25T05:10:36Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"11350f8daf165a5d3f834dd2eccd760832dc8b6e197dfebf07c8afdd7902109d","abstract_canon_sha256":"74994c4b2cc42787b6b44aecac6fe4b756a6e565154911291d3c4f32184a6933"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:11:08.894959Z","signature_b64":"HrlXJrSu+z5LilOeyLA4E3rj/9vuzGKpJmQrpTTefNvnkHfAKe8IBUtCrSO6UgFBWj/pnu5pZiCjctwoaErxDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8aed6c24426d25ae80c4f85922b819755dba6d3b80902113e1fff4c0eb0b85d7","last_reissued_at":"2026-05-18T04:11:08.894468Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:11:08.894468Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Projection-Forcing Multisets of Weight Changes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.CO","authors_text":"Josh Brown Kramer, Lucas Sabalka","submitted_at":"2009-03-25T05:10:36Z","abstract_excerpt":"Let $F$ be a finite field. A multiset $S$ of integers is projection-forcing if for every linear function $\\phi : F^n \\to F^m$ whose multiset of weight changes is $S$, $\\phi$ is a coordinate projection up to permutation and scaling of entries. The MacWilliams Extension Theorem from coding theory says that $S = \\{0, 0, ..., 0\\}$ is projection-forcing. We give a (super-polynomial) algorithm to determine whether or not a given $S$ is projection-forcing. We also give a condition that can be checked in polynomial time that implies that $S$ is projection-forcing. This result is a generalization of th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0903.4237","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":"0903.4237","created_at":"2026-05-18T04:11:08.894553+00:00"},{"alias_kind":"arxiv_version","alias_value":"0903.4237v2","created_at":"2026-05-18T04:11:08.894553+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0903.4237","created_at":"2026-05-18T04:11:08.894553+00:00"},{"alias_kind":"pith_short_12","alias_value":"RLWWYJCCNUS2","created_at":"2026-05-18T12:26:01.383474+00:00"},{"alias_kind":"pith_short_16","alias_value":"RLWWYJCCNUS25AGE","created_at":"2026-05-18T12:26:01.383474+00:00"},{"alias_kind":"pith_short_8","alias_value":"RLWWYJCC","created_at":"2026-05-18T12:26:01.383474+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/RLWWYJCCNUS25AGE7BMSFOAZOV","json":"https://pith.science/pith/RLWWYJCCNUS25AGE7BMSFOAZOV.json","graph_json":"https://pith.science/api/pith-number/RLWWYJCCNUS25AGE7BMSFOAZOV/graph.json","events_json":"https://pith.science/api/pith-number/RLWWYJCCNUS25AGE7BMSFOAZOV/events.json","paper":"https://pith.science/paper/RLWWYJCC"},"agent_actions":{"view_html":"https://pith.science/pith/RLWWYJCCNUS25AGE7BMSFOAZOV","download_json":"https://pith.science/pith/RLWWYJCCNUS25AGE7BMSFOAZOV.json","view_paper":"https://pith.science/paper/RLWWYJCC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0903.4237&json=true","fetch_graph":"https://pith.science/api/pith-number/RLWWYJCCNUS25AGE7BMSFOAZOV/graph.json","fetch_events":"https://pith.science/api/pith-number/RLWWYJCCNUS25AGE7BMSFOAZOV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RLWWYJCCNUS25AGE7BMSFOAZOV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RLWWYJCCNUS25AGE7BMSFOAZOV/action/storage_attestation","attest_author":"https://pith.science/pith/RLWWYJCCNUS25AGE7BMSFOAZOV/action/author_attestation","sign_citation":"https://pith.science/pith/RLWWYJCCNUS25AGE7BMSFOAZOV/action/citation_signature","submit_replication":"https://pith.science/pith/RLWWYJCCNUS25AGE7BMSFOAZOV/action/replication_record"}},"created_at":"2026-05-18T04:11:08.894553+00:00","updated_at":"2026-05-18T04:11:08.894553+00:00"}