{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:MYFXWJIR2XPFWDOXFEY54PPT4P","short_pith_number":"pith:MYFXWJIR","schema_version":"1.0","canonical_sha256":"660b7b2511d5de5b0dd72931de3df3e3eb98cfb59767c21122f2b2b1411d0a30","source":{"kind":"arxiv","id":"1611.08498","version":2},"attestation_state":"computed","paper":{"title":"On solution-free sets of integers II","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NT"],"primary_cat":"math.CO","authors_text":"Andrew Treglown, Robert Hancock","submitted_at":"2016-11-25T15:54:20Z","abstract_excerpt":"Given a linear equation $\\mathcal{L}$, a set $A \\subseteq [n]$ is $\\mathcal{L}$-free if $A$ does not contain any `non-trivial' solutions to $\\mathcal{L}$. We determine the precise size of the largest $\\mathcal{L}$-free subset of $[n]$ for several general classes of linear equations $\\mathcal{L}$ of the form $px+qy=rz$ for fixed $p,q,r \\in \\mathbb N$ where $p \\geq q \\geq r$. Further, for all such linear equations $\\mathcal{L}$, we give an upper bound on the number of maximal $\\mathcal{L}$-free subsets of $[n]$. In the case when $p=q\\geq 2$ and $r=1$ this bound is exact up to an error term in 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":"1611.08498","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-25T15:54:20Z","cross_cats_sorted":["math.NT"],"title_canon_sha256":"6f87c305029d3f12ac7cf3444cfa401346cfdb9c5c08132a2a3905c500f1d177","abstract_canon_sha256":"c541ea1c9a6624c555dcc73cc0f3c8a9645a16204492fa05714b78769b80e9ed"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:39.607539Z","signature_b64":"tCvAd1nyMPO+gVqFXkB20ULVnBZRBAa+IqGFh52iOySNSeaEFB3kMsc7UzKdxvBfwsQmdSD2HbsvH0YLc2mCAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"660b7b2511d5de5b0dd72931de3df3e3eb98cfb59767c21122f2b2b1411d0a30","last_reissued_at":"2026-05-18T00:39:39.606884Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:39.606884Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On solution-free sets of integers II","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NT"],"primary_cat":"math.CO","authors_text":"Andrew Treglown, Robert Hancock","submitted_at":"2016-11-25T15:54:20Z","abstract_excerpt":"Given a linear equation $\\mathcal{L}$, a set $A \\subseteq [n]$ is $\\mathcal{L}$-free if $A$ does not contain any `non-trivial' solutions to $\\mathcal{L}$. We determine the precise size of the largest $\\mathcal{L}$-free subset of $[n]$ for several general classes of linear equations $\\mathcal{L}$ of the form $px+qy=rz$ for fixed $p,q,r \\in \\mathbb N$ where $p \\geq q \\geq r$. Further, for all such linear equations $\\mathcal{L}$, we give an upper bound on the number of maximal $\\mathcal{L}$-free subsets of $[n]$. In the case when $p=q\\geq 2$ and $r=1$ this bound is exact up to an error term in th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.08498","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":"1611.08498","created_at":"2026-05-18T00:39:39.606979+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.08498v2","created_at":"2026-05-18T00:39:39.606979+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.08498","created_at":"2026-05-18T00:39:39.606979+00:00"},{"alias_kind":"pith_short_12","alias_value":"MYFXWJIR2XPF","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_16","alias_value":"MYFXWJIR2XPFWDOX","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_8","alias_value":"MYFXWJIR","created_at":"2026-05-18T12:30:32.724797+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/MYFXWJIR2XPFWDOXFEY54PPT4P","json":"https://pith.science/pith/MYFXWJIR2XPFWDOXFEY54PPT4P.json","graph_json":"https://pith.science/api/pith-number/MYFXWJIR2XPFWDOXFEY54PPT4P/graph.json","events_json":"https://pith.science/api/pith-number/MYFXWJIR2XPFWDOXFEY54PPT4P/events.json","paper":"https://pith.science/paper/MYFXWJIR"},"agent_actions":{"view_html":"https://pith.science/pith/MYFXWJIR2XPFWDOXFEY54PPT4P","download_json":"https://pith.science/pith/MYFXWJIR2XPFWDOXFEY54PPT4P.json","view_paper":"https://pith.science/paper/MYFXWJIR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.08498&json=true","fetch_graph":"https://pith.science/api/pith-number/MYFXWJIR2XPFWDOXFEY54PPT4P/graph.json","fetch_events":"https://pith.science/api/pith-number/MYFXWJIR2XPFWDOXFEY54PPT4P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MYFXWJIR2XPFWDOXFEY54PPT4P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MYFXWJIR2XPFWDOXFEY54PPT4P/action/storage_attestation","attest_author":"https://pith.science/pith/MYFXWJIR2XPFWDOXFEY54PPT4P/action/author_attestation","sign_citation":"https://pith.science/pith/MYFXWJIR2XPFWDOXFEY54PPT4P/action/citation_signature","submit_replication":"https://pith.science/pith/MYFXWJIR2XPFWDOXFEY54PPT4P/action/replication_record"}},"created_at":"2026-05-18T00:39:39.606979+00:00","updated_at":"2026-05-18T00:39:39.606979+00:00"}