{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:U6OMLMXY4HNC6MSZRDVSPWC7LO","short_pith_number":"pith:U6OMLMXY","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"},"canonical_sha256":"a79cc5b2f8e1da2f325988eb27d85f5bb811179de8f69a31bf405eb441500ba7","source":{"kind":"arxiv","id":"1704.03758","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.03758","created_at":"2026-05-18T00:46:26Z"},{"alias_kind":"arxiv_version","alias_value":"1704.03758v1","created_at":"2026-05-18T00:46:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.03758","created_at":"2026-05-18T00:46:26Z"},{"alias_kind":"pith_short_12","alias_value":"U6OMLMXY4HNC","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"U6OMLMXY4HNC6MSZ","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"U6OMLMXY","created_at":"2026-05-18T12:31:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:U6OMLMXY4HNC6MSZRDVSPWC7LO","target":"record","payload":{"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"},"canonical_sha256":"a79cc5b2f8e1da2f325988eb27d85f5bb811179de8f69a31bf405eb441500ba7","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"},"source_kind":"arxiv","source_id":"1704.03758","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:46:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V/jTLf4Tg+9p4jaoAx73Ru+BdQO0fejoDfDGxtlh1IQPsPwwL6fX8bmdFqsvZrEedo4zhs6cJWJYJUhMtDNWCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T04:12:14.633575Z"},"content_sha256":"0377f77cdc341cac0b6653deb4f299e08f58171e78f04a450aea2656a04fa783","schema_version":"1.0","event_id":"sha256:0377f77cdc341cac0b6653deb4f299e08f58171e78f04a450aea2656a04fa783"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:U6OMLMXY4HNC6MSZRDVSPWC7LO","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:46:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ECAjgW37OAITyqzpwYDbKeXVt2pT/G1tmlygtnb556WWh9unxBPNrYE5Cl+Am4TyiI0Cgl2qj6ft4xEtsb/RAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T04:12:14.633922Z"},"content_sha256":"e80e302c837b44900bc7b1a098cdcdc44bf9bec15157baaabef8befa28fb63dd","schema_version":"1.0","event_id":"sha256:e80e302c837b44900bc7b1a098cdcdc44bf9bec15157baaabef8befa28fb63dd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/U6OMLMXY4HNC6MSZRDVSPWC7LO/bundle.json","state_url":"https://pith.science/pith/U6OMLMXY4HNC6MSZRDVSPWC7LO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/U6OMLMXY4HNC6MSZRDVSPWC7LO/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-23T04:12:14Z","links":{"resolver":"https://pith.science/pith/U6OMLMXY4HNC6MSZRDVSPWC7LO","bundle":"https://pith.science/pith/U6OMLMXY4HNC6MSZRDVSPWC7LO/bundle.json","state":"https://pith.science/pith/U6OMLMXY4HNC6MSZRDVSPWC7LO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/U6OMLMXY4HNC6MSZRDVSPWC7LO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:U6OMLMXY4HNC6MSZRDVSPWC7LO","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"eaf58b43e67090aa1c1fc08af91c2a91a57b6c440c5233105face52205adbb12","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-04-12T13:56:19Z","title_canon_sha256":"ee7f832d377abeec6e7d7f253208fe8351f044d915822cf9e2d5f4e91822378c"},"schema_version":"1.0","source":{"id":"1704.03758","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.03758","created_at":"2026-05-18T00:46:26Z"},{"alias_kind":"arxiv_version","alias_value":"1704.03758v1","created_at":"2026-05-18T00:46:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.03758","created_at":"2026-05-18T00:46:26Z"},{"alias_kind":"pith_short_12","alias_value":"U6OMLMXY4HNC","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"U6OMLMXY4HNC6MSZ","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"U6OMLMXY","created_at":"2026-05-18T12:31:46Z"}],"graph_snapshots":[{"event_id":"sha256:e80e302c837b44900bc7b1a098cdcdc44bf9bec15157baaabef8befa28fb63dd","target":"graph","created_at":"2026-05-18T00:46:26Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Andrew Treglown, Kitty Meeks","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-04-12T13:56:19Z","title":"On the complexity of finding and counting solution-free sets of integers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.03758","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:0377f77cdc341cac0b6653deb4f299e08f58171e78f04a450aea2656a04fa783","target":"record","created_at":"2026-05-18T00:46:26Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"eaf58b43e67090aa1c1fc08af91c2a91a57b6c440c5233105face52205adbb12","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-04-12T13:56:19Z","title_canon_sha256":"ee7f832d377abeec6e7d7f253208fe8351f044d915822cf9e2d5f4e91822378c"},"schema_version":"1.0","source":{"id":"1704.03758","kind":"arxiv","version":1}},"canonical_sha256":"a79cc5b2f8e1da2f325988eb27d85f5bb811179de8f69a31bf405eb441500ba7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a79cc5b2f8e1da2f325988eb27d85f5bb811179de8f69a31bf405eb441500ba7","first_computed_at":"2026-05-18T00:46:26.938466Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:46:26.938466Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ukzb8xI9VKXKPJJ+FAzTP1pBNiR12crcliJbkQ+x1ZSXLkaZLMboSgMy2g2sXSM8Jkg2PdhDXyARFp0HhBRlCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:46:26.938945Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.03758","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0377f77cdc341cac0b6653deb4f299e08f58171e78f04a450aea2656a04fa783","sha256:e80e302c837b44900bc7b1a098cdcdc44bf9bec15157baaabef8befa28fb63dd"],"state_sha256":"699e44ccb231a5d6b2f61c4b5224391c34ed7d623fb8a74db03c8406cffa81dc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j8qFtLSqeIFpqcr66BSTNKXIRKuAfLAAhJCtEBEbnW61cpLrSpjyjPLcLte9XC8OnHMPIXSC6VU0pZ8daeosBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T04:12:14.636045Z","bundle_sha256":"16f3a348e42b3d19f45f0089bf8fd6a10406267582fbd78c940b8500b895a31a"}}