{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:5MQAB4DXECIWEH44MWI5PTNLQV","short_pith_number":"pith:5MQAB4DX","schema_version":"1.0","canonical_sha256":"eb2000f0772091621f9c6591d7cdab857934510d2fd223eed5cab653409b6819","source":{"kind":"arxiv","id":"1505.02280","version":1},"attestation_state":"computed","paper":{"title":"On the removal lemma for linear configurations in finite abelian groups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Llu\\'is Vena","submitted_at":"2015-05-09T14:48:07Z","abstract_excerpt":"We present a general framework to represent discrete configuration systems using hypergraphs. This representation allows one to transfer combinatorial removal lemmas to their analogues for configuration systems. These removal lemmas claim that a system without many configurations can be made configuration-free by removing a few of its constituent elements. As applications of this approach we give, an alternative proof of the removal lemma for permutations by Cooper, a general version of a removal lemma for linear systems in finite abelian groups, an interpretation of the mentioned removal lemm"},"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":"1505.02280","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-05-09T14:48:07Z","cross_cats_sorted":[],"title_canon_sha256":"e063049be37a240f0d93d0d8964ab75d9d11e0ce2ce56f13ada8d5de6b2c80ad","abstract_canon_sha256":"1594c9a78b912611c5007537fccc13649ac9604110eb034740befe9e8193afe0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:16:19.331557Z","signature_b64":"YLNXLo0qipi3+O3+j18Hlon3bACsQSyO7A1WxMewZE1EHbEYsk3J6Uv3AVKly7KExeUhIscjLMHKvsgwzCdiBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eb2000f0772091621f9c6591d7cdab857934510d2fd223eed5cab653409b6819","last_reissued_at":"2026-05-18T02:16:19.330863Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:16:19.330863Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the removal lemma for linear configurations in finite abelian groups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Llu\\'is Vena","submitted_at":"2015-05-09T14:48:07Z","abstract_excerpt":"We present a general framework to represent discrete configuration systems using hypergraphs. This representation allows one to transfer combinatorial removal lemmas to their analogues for configuration systems. These removal lemmas claim that a system without many configurations can be made configuration-free by removing a few of its constituent elements. As applications of this approach we give, an alternative proof of the removal lemma for permutations by Cooper, a general version of a removal lemma for linear systems in finite abelian groups, an interpretation of the mentioned removal lemm"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.02280","kind":"arxiv","version":1},"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":"1505.02280","created_at":"2026-05-18T02:16:19.330960+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.02280v1","created_at":"2026-05-18T02:16:19.330960+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.02280","created_at":"2026-05-18T02:16:19.330960+00:00"},{"alias_kind":"pith_short_12","alias_value":"5MQAB4DXECIW","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_16","alias_value":"5MQAB4DXECIWEH44","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_8","alias_value":"5MQAB4DX","created_at":"2026-05-18T12:29:05.191682+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/5MQAB4DXECIWEH44MWI5PTNLQV","json":"https://pith.science/pith/5MQAB4DXECIWEH44MWI5PTNLQV.json","graph_json":"https://pith.science/api/pith-number/5MQAB4DXECIWEH44MWI5PTNLQV/graph.json","events_json":"https://pith.science/api/pith-number/5MQAB4DXECIWEH44MWI5PTNLQV/events.json","paper":"https://pith.science/paper/5MQAB4DX"},"agent_actions":{"view_html":"https://pith.science/pith/5MQAB4DXECIWEH44MWI5PTNLQV","download_json":"https://pith.science/pith/5MQAB4DXECIWEH44MWI5PTNLQV.json","view_paper":"https://pith.science/paper/5MQAB4DX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.02280&json=true","fetch_graph":"https://pith.science/api/pith-number/5MQAB4DXECIWEH44MWI5PTNLQV/graph.json","fetch_events":"https://pith.science/api/pith-number/5MQAB4DXECIWEH44MWI5PTNLQV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5MQAB4DXECIWEH44MWI5PTNLQV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5MQAB4DXECIWEH44MWI5PTNLQV/action/storage_attestation","attest_author":"https://pith.science/pith/5MQAB4DXECIWEH44MWI5PTNLQV/action/author_attestation","sign_citation":"https://pith.science/pith/5MQAB4DXECIWEH44MWI5PTNLQV/action/citation_signature","submit_replication":"https://pith.science/pith/5MQAB4DXECIWEH44MWI5PTNLQV/action/replication_record"}},"created_at":"2026-05-18T02:16:19.330960+00:00","updated_at":"2026-05-18T02:16:19.330960+00:00"}