{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:U6OMLMXY4HNC6MSZRDVSPWC7LO","short_pith_number":"pith:U6OMLMXY","schema_version":"1.0","canonical_sha256":"a79cc5b2f8e1da2f325988eb27d85f5bb811179de8f69a31bf405eb441500ba7","source":{"kind":"arxiv","id":"1704.03758","version":1},"attestation_state":"computed","paper":{"title":"On the complexity of finding and counting solution-free sets of integers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"math.CO","authors_text":"Andrew Treglown, Kitty Meeks","submitted_at":"2017-04-12T13:56:19Z","abstract_excerpt":"Given a linear equation $\\mathcal{L}$, a set $A$ of integers is $\\mathcal{L}$-free if $A$ does not contain any `non-trivial' solutions to $\\mathcal{L}$. This notion incorporates many central topics in combinatorial number theory such as sum-free and progression-free sets. In this paper we initiate the study of (parameterised) complexity questions involving $\\mathcal{L}$-free sets of integers. The main questions we consider involve deciding whether a finite set of integers $A$ has an $\\mathcal{L}$-free subset of a given size, and counting all such $\\mathcal{L}$-free subsets. We also raise a num"},"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":"1704.03758","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-04-12T13:56:19Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"ee7f832d377abeec6e7d7f253208fe8351f044d915822cf9e2d5f4e91822378c","abstract_canon_sha256":"eaf58b43e67090aa1c1fc08af91c2a91a57b6c440c5233105face52205adbb12"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:26.938945Z","signature_b64":"Ukzb8xI9VKXKPJJ+FAzTP1pBNiR12crcliJbkQ+x1ZSXLkaZLMboSgMy2g2sXSM8Jkg2PdhDXyARFp0HhBRlCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a79cc5b2f8e1da2f325988eb27d85f5bb811179de8f69a31bf405eb441500ba7","last_reissued_at":"2026-05-18T00:46:26.938466Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:26.938466Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the complexity of finding and counting solution-free sets of integers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"math.CO","authors_text":"Andrew Treglown, Kitty Meeks","submitted_at":"2017-04-12T13:56:19Z","abstract_excerpt":"Given a linear equation $\\mathcal{L}$, a set $A$ of integers is $\\mathcal{L}$-free if $A$ does not contain any `non-trivial' solutions to $\\mathcal{L}$. This notion incorporates many central topics in combinatorial number theory such as sum-free and progression-free sets. In this paper we initiate the study of (parameterised) complexity questions involving $\\mathcal{L}$-free sets of integers. The main questions we consider involve deciding whether a finite set of integers $A$ has an $\\mathcal{L}$-free subset of a given size, and counting all such $\\mathcal{L}$-free subsets. We also raise a num"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.03758","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":"1704.03758","created_at":"2026-05-18T00:46:26.938550+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.03758v1","created_at":"2026-05-18T00:46:26.938550+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.03758","created_at":"2026-05-18T00:46:26.938550+00:00"},{"alias_kind":"pith_short_12","alias_value":"U6OMLMXY4HNC","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_16","alias_value":"U6OMLMXY4HNC6MSZ","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_8","alias_value":"U6OMLMXY","created_at":"2026-05-18T12:31:46.661854+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/U6OMLMXY4HNC6MSZRDVSPWC7LO","json":"https://pith.science/pith/U6OMLMXY4HNC6MSZRDVSPWC7LO.json","graph_json":"https://pith.science/api/pith-number/U6OMLMXY4HNC6MSZRDVSPWC7LO/graph.json","events_json":"https://pith.science/api/pith-number/U6OMLMXY4HNC6MSZRDVSPWC7LO/events.json","paper":"https://pith.science/paper/U6OMLMXY"},"agent_actions":{"view_html":"https://pith.science/pith/U6OMLMXY4HNC6MSZRDVSPWC7LO","download_json":"https://pith.science/pith/U6OMLMXY4HNC6MSZRDVSPWC7LO.json","view_paper":"https://pith.science/paper/U6OMLMXY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.03758&json=true","fetch_graph":"https://pith.science/api/pith-number/U6OMLMXY4HNC6MSZRDVSPWC7LO/graph.json","fetch_events":"https://pith.science/api/pith-number/U6OMLMXY4HNC6MSZRDVSPWC7LO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U6OMLMXY4HNC6MSZRDVSPWC7LO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U6OMLMXY4HNC6MSZRDVSPWC7LO/action/storage_attestation","attest_author":"https://pith.science/pith/U6OMLMXY4HNC6MSZRDVSPWC7LO/action/author_attestation","sign_citation":"https://pith.science/pith/U6OMLMXY4HNC6MSZRDVSPWC7LO/action/citation_signature","submit_replication":"https://pith.science/pith/U6OMLMXY4HNC6MSZRDVSPWC7LO/action/replication_record"}},"created_at":"2026-05-18T00:46:26.938550+00:00","updated_at":"2026-05-18T00:46:26.938550+00:00"}