{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:3AIZOJAM55DWPE2KT63BNCNVSY","short_pith_number":"pith:3AIZOJAM","schema_version":"1.0","canonical_sha256":"d81197240cef4767934a9fb61689b59622297399fefd6e39c7607d6d539aa432","source":{"kind":"arxiv","id":"1812.09259","version":1},"attestation_state":"computed","paper":{"title":"The complexity of solution-free sets of integers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Keith J. Edwards, Steven D. Noble","submitted_at":"2018-12-20T13:10:21Z","abstract_excerpt":"Given a linear equation L, a set A of integers is L-free if A does not contain any non-trivial solutions to L. Meeks and Treglown showed that for certain kinds of linear equations, it is NP-complete to decide if a given set of integers contains a solution-free subset of a given size. Also, for equations involving three variables, they showed that the problem of determining the size of the largest solution-free subset is APX-hard, and that for two such equations (representing sum-free and progression-free sets), the problem of deciding if there is a solution-free subset with at least a specifie"},"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":"1812.09259","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-12-20T13:10:21Z","cross_cats_sorted":[],"title_canon_sha256":"4d5b26744d6e156cedc1a61d90bd09b00eb0f31136ffef10f66a07d808714444","abstract_canon_sha256":"e14bc3adc05bc67dbd0796c1286f70990ee44ff81f991a0572f135d9a5f9a0c2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:44.958712Z","signature_b64":"3+SGiJN7XCmROedRTUBObtoDnE/XlyswmgdhqGpiY3W+q1mMBAZSN+6ZN/EjrnVB/DMyRFdpwpP7ivIYiSR4Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d81197240cef4767934a9fb61689b59622297399fefd6e39c7607d6d539aa432","last_reissued_at":"2026-05-17T23:57:44.958071Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:44.958071Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The complexity of solution-free sets of integers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Keith J. Edwards, Steven D. Noble","submitted_at":"2018-12-20T13:10:21Z","abstract_excerpt":"Given a linear equation L, a set A of integers is L-free if A does not contain any non-trivial solutions to L. Meeks and Treglown showed that for certain kinds of linear equations, it is NP-complete to decide if a given set of integers contains a solution-free subset of a given size. Also, for equations involving three variables, they showed that the problem of determining the size of the largest solution-free subset is APX-hard, and that for two such equations (representing sum-free and progression-free sets), the problem of deciding if there is a solution-free subset with at least a specifie"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.09259","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":"1812.09259","created_at":"2026-05-17T23:57:44.958164+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.09259v1","created_at":"2026-05-17T23:57:44.958164+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.09259","created_at":"2026-05-17T23:57:44.958164+00:00"},{"alias_kind":"pith_short_12","alias_value":"3AIZOJAM55DW","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_16","alias_value":"3AIZOJAM55DWPE2K","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_8","alias_value":"3AIZOJAM","created_at":"2026-05-18T12:32:02.567920+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/3AIZOJAM55DWPE2KT63BNCNVSY","json":"https://pith.science/pith/3AIZOJAM55DWPE2KT63BNCNVSY.json","graph_json":"https://pith.science/api/pith-number/3AIZOJAM55DWPE2KT63BNCNVSY/graph.json","events_json":"https://pith.science/api/pith-number/3AIZOJAM55DWPE2KT63BNCNVSY/events.json","paper":"https://pith.science/paper/3AIZOJAM"},"agent_actions":{"view_html":"https://pith.science/pith/3AIZOJAM55DWPE2KT63BNCNVSY","download_json":"https://pith.science/pith/3AIZOJAM55DWPE2KT63BNCNVSY.json","view_paper":"https://pith.science/paper/3AIZOJAM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.09259&json=true","fetch_graph":"https://pith.science/api/pith-number/3AIZOJAM55DWPE2KT63BNCNVSY/graph.json","fetch_events":"https://pith.science/api/pith-number/3AIZOJAM55DWPE2KT63BNCNVSY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3AIZOJAM55DWPE2KT63BNCNVSY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3AIZOJAM55DWPE2KT63BNCNVSY/action/storage_attestation","attest_author":"https://pith.science/pith/3AIZOJAM55DWPE2KT63BNCNVSY/action/author_attestation","sign_citation":"https://pith.science/pith/3AIZOJAM55DWPE2KT63BNCNVSY/action/citation_signature","submit_replication":"https://pith.science/pith/3AIZOJAM55DWPE2KT63BNCNVSY/action/replication_record"}},"created_at":"2026-05-17T23:57:44.958164+00:00","updated_at":"2026-05-17T23:57:44.958164+00:00"}