{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:CC7QUHJMNMMDRJVPIH44FIJJZI","short_pith_number":"pith:CC7QUHJM","canonical_record":{"source":{"id":"1607.08399","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-07-28T11:07:18Z","cross_cats_sorted":["math.NT"],"title_canon_sha256":"b6d5397e138912ce951fdb74e938397c959bc93fea0fc46dcf0453d9d4497dd2","abstract_canon_sha256":"1c798efd581278037c8d08ce6f7cda3e1481ba950fd9cd3c4a5cce205e2e09b5"},"schema_version":"1.0"},"canonical_sha256":"10bf0a1d2c6b1838a6af41f9c2a129ca37c67dafdcfa76ad8b2d9dafec5598d1","source":{"kind":"arxiv","id":"1607.08399","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.08399","created_at":"2026-05-18T01:01:51Z"},{"alias_kind":"arxiv_version","alias_value":"1607.08399v2","created_at":"2026-05-18T01:01:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.08399","created_at":"2026-05-18T01:01:51Z"},{"alias_kind":"pith_short_12","alias_value":"CC7QUHJMNMMD","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"CC7QUHJMNMMDRJVP","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"CC7QUHJM","created_at":"2026-05-18T12:30:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:CC7QUHJMNMMDRJVPIH44FIJJZI","target":"record","payload":{"canonical_record":{"source":{"id":"1607.08399","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-07-28T11:07:18Z","cross_cats_sorted":["math.NT"],"title_canon_sha256":"b6d5397e138912ce951fdb74e938397c959bc93fea0fc46dcf0453d9d4497dd2","abstract_canon_sha256":"1c798efd581278037c8d08ce6f7cda3e1481ba950fd9cd3c4a5cce205e2e09b5"},"schema_version":"1.0"},"canonical_sha256":"10bf0a1d2c6b1838a6af41f9c2a129ca37c67dafdcfa76ad8b2d9dafec5598d1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:01:51.579229Z","signature_b64":"Amatn5E3Hcf5MWyu289M2mueR/ANO4vMT6MPHugCpANGjBfv7KCpPANurlrO9FZNzm/Xn0fc1j88OuNIVrKjAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"10bf0a1d2c6b1838a6af41f9c2a129ca37c67dafdcfa76ad8b2d9dafec5598d1","last_reissued_at":"2026-05-18T01:01:51.578573Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:01:51.578573Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.08399","source_version":2,"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-18T01:01:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jez5VvVcpyNvQXL1e0j/wrX0EuCtiPa73xX2QaRiNp6g+7cp45em/T2BynEeDeYOUmGO8GdhiKnzH8XdKm0aCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T22:46:12.936693Z"},"content_sha256":"47380c5d7d36461469ce1724bb9196cba5b2f85162c99de2c4d4c5900138b789","schema_version":"1.0","event_id":"sha256:47380c5d7d36461469ce1724bb9196cba5b2f85162c99de2c4d4c5900138b789"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:CC7QUHJMNMMDRJVPIH44FIJJZI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On solution-free sets of integers","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-07-28T11:07:18Z","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}$. In this paper we consider the following three general questions:\n  (i) What is the size of the largest $\\mathcal{L}$-free subset of $[n]$?\n  (ii) How many $\\mathcal{L}$-free subsets of $[n]$ are there?\n  (iii) How many maximal $\\mathcal{L}$-free subsets of $[n]$ are there?\n  We completely resolve (i) in the case when $\\mathcal{L}$ is the equation $px+qy=z$ for fixed $p,q\\in \\mathbb N$ where $p\\geq 2$. Further, up to a multiplicative constant"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.08399","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"},"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-18T01:01:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n8ZtaocSJovkF41vW996sA/6GlZQfhFajNE6VNGMNLameZd2T9oWGO/gLz4wGWrPPFuxuAGo2qjcjAuq/wJmDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T22:46:12.937080Z"},"content_sha256":"ee109a9f9004e30d4e5a4249683c266bf861fbb7b5ba9a5a3962c2918bd099aa","schema_version":"1.0","event_id":"sha256:ee109a9f9004e30d4e5a4249683c266bf861fbb7b5ba9a5a3962c2918bd099aa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CC7QUHJMNMMDRJVPIH44FIJJZI/bundle.json","state_url":"https://pith.science/pith/CC7QUHJMNMMDRJVPIH44FIJJZI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CC7QUHJMNMMDRJVPIH44FIJJZI/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-22T22:46:12Z","links":{"resolver":"https://pith.science/pith/CC7QUHJMNMMDRJVPIH44FIJJZI","bundle":"https://pith.science/pith/CC7QUHJMNMMDRJVPIH44FIJJZI/bundle.json","state":"https://pith.science/pith/CC7QUHJMNMMDRJVPIH44FIJJZI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CC7QUHJMNMMDRJVPIH44FIJJZI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:CC7QUHJMNMMDRJVPIH44FIJJZI","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":"1c798efd581278037c8d08ce6f7cda3e1481ba950fd9cd3c4a5cce205e2e09b5","cross_cats_sorted":["math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-07-28T11:07:18Z","title_canon_sha256":"b6d5397e138912ce951fdb74e938397c959bc93fea0fc46dcf0453d9d4497dd2"},"schema_version":"1.0","source":{"id":"1607.08399","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.08399","created_at":"2026-05-18T01:01:51Z"},{"alias_kind":"arxiv_version","alias_value":"1607.08399v2","created_at":"2026-05-18T01:01:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.08399","created_at":"2026-05-18T01:01:51Z"},{"alias_kind":"pith_short_12","alias_value":"CC7QUHJMNMMD","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"CC7QUHJMNMMDRJVP","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"CC7QUHJM","created_at":"2026-05-18T12:30:09Z"}],"graph_snapshots":[{"event_id":"sha256:ee109a9f9004e30d4e5a4249683c266bf861fbb7b5ba9a5a3962c2918bd099aa","target":"graph","created_at":"2026-05-18T01:01:51Z","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 \\subseteq [n]$ is $\\mathcal{L}$-free if $A$ does not contain any `non-trivial' solutions to $\\mathcal{L}$. In this paper we consider the following three general questions:\n  (i) What is the size of the largest $\\mathcal{L}$-free subset of $[n]$?\n  (ii) How many $\\mathcal{L}$-free subsets of $[n]$ are there?\n  (iii) How many maximal $\\mathcal{L}$-free subsets of $[n]$ are there?\n  We completely resolve (i) in the case when $\\mathcal{L}$ is the equation $px+qy=z$ for fixed $p,q\\in \\mathbb N$ where $p\\geq 2$. Further, up to a multiplicative constant","authors_text":"Andrew Treglown, Robert Hancock","cross_cats":["math.NT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-07-28T11:07:18Z","title":"On solution-free sets of integers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.08399","kind":"arxiv","version":2},"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:47380c5d7d36461469ce1724bb9196cba5b2f85162c99de2c4d4c5900138b789","target":"record","created_at":"2026-05-18T01:01:51Z","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":"1c798efd581278037c8d08ce6f7cda3e1481ba950fd9cd3c4a5cce205e2e09b5","cross_cats_sorted":["math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-07-28T11:07:18Z","title_canon_sha256":"b6d5397e138912ce951fdb74e938397c959bc93fea0fc46dcf0453d9d4497dd2"},"schema_version":"1.0","source":{"id":"1607.08399","kind":"arxiv","version":2}},"canonical_sha256":"10bf0a1d2c6b1838a6af41f9c2a129ca37c67dafdcfa76ad8b2d9dafec5598d1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"10bf0a1d2c6b1838a6af41f9c2a129ca37c67dafdcfa76ad8b2d9dafec5598d1","first_computed_at":"2026-05-18T01:01:51.578573Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:01:51.578573Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Amatn5E3Hcf5MWyu289M2mueR/ANO4vMT6MPHugCpANGjBfv7KCpPANurlrO9FZNzm/Xn0fc1j88OuNIVrKjAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:01:51.579229Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.08399","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:47380c5d7d36461469ce1724bb9196cba5b2f85162c99de2c4d4c5900138b789","sha256:ee109a9f9004e30d4e5a4249683c266bf861fbb7b5ba9a5a3962c2918bd099aa"],"state_sha256":"cb87125711b3de6319fd8bdb7036791b5495aade96aaa525c33bb8f7bb0321ab"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"29E2WRd4utJCAul3KHAHJ4IEqKolYiBtQSO8Ggphhac82D4DRnoZ/dGFPl1EGywPMfJZUSgxTuUr6xh4nG8XBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T22:46:12.939098Z","bundle_sha256":"8ad4bffec5b90bac70645e83ec2c79a3f99f66ef645149e68262c1f14f8081db"}}