{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:GS6EFXBGDCIIUX3F3KAEJA22LC","short_pith_number":"pith:GS6EFXBG","canonical_record":{"source":{"id":"2611.17205","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-11-12T18:05:45Z","cross_cats_sorted":["math.NT"],"title_canon_sha256":"742c773db8dfc3c176b37e1869c9bbafac1513b76c9b9d2ba89bdd4c263226dd","abstract_canon_sha256":"4d21dc7d8b9d0a8a27c72884e48780e2d85573ecdda9ef401ff594b04c5d9dc3"},"schema_version":"1.0"},"canonical_sha256":"34bc42dc2618908a5f65da8044835a58b369b788461037fbfdbe00104cde7ecb","source":{"kind":"arxiv","id":"2611.17205","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2611.17205","created_at":"2026-11-13T06:32:42Z"},{"alias_kind":"arxiv_version","alias_value":"2611.17205v1","created_at":"2026-11-13T06:32:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2611.17205","created_at":"2026-11-13T06:32:42Z"},{"alias_kind":"pith_short_12","alias_value":"GS6EFXBGDCII","created_at":"2026-11-13T06:32:42Z"},{"alias_kind":"pith_short_16","alias_value":"GS6EFXBGDCIIUX3F","created_at":"2026-11-13T06:32:42Z"},{"alias_kind":"pith_short_8","alias_value":"GS6EFXBG","created_at":"2026-11-13T06:32:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:GS6EFXBGDCIIUX3F3KAEJA22LC","target":"record","payload":{"canonical_record":{"source":{"id":"2611.17205","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-11-12T18:05:45Z","cross_cats_sorted":["math.NT"],"title_canon_sha256":"742c773db8dfc3c176b37e1869c9bbafac1513b76c9b9d2ba89bdd4c263226dd","abstract_canon_sha256":"4d21dc7d8b9d0a8a27c72884e48780e2d85573ecdda9ef401ff594b04c5d9dc3"},"schema_version":"1.0"},"canonical_sha256":"34bc42dc2618908a5f65da8044835a58b369b788461037fbfdbe00104cde7ecb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-11-13T06:32:42.069374Z","signature_b64":"9XUbzcDCiWU+6d2x9hHP21LaRUHhBYpXBwYULSS/nBfEqmttu5i4lN9ApOEyDv3fltYWsqf4ZygkP1dMpG9dBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"34bc42dc2618908a5f65da8044835a58b369b788461037fbfdbe00104cde7ecb","last_reissued_at":"2026-11-13T06:32:42.067045Z","signature_status":"signed_v1","first_computed_at":"2026-11-13T06:32:42.067045Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2611.17205","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-11-13T06:32:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"96z22PcFdpQNI7Waoo6n1qWOm7N7VN375WaAGzby+XK2sBujw7maG+MTmero8tAVFBjTJbBRdeRh4mcOwQzyAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-11-16T03:05:02.908194Z"},"content_sha256":"87dd82d8550e65cb7663bd7b4503dfdc7c3ad78ae32f384ae87e23e2717423d9","schema_version":"1.0","event_id":"sha256:87dd82d8550e65cb7663bd7b4503dfdc7c3ad78ae32f384ae87e23e2717423d9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:GS6EFXBGDCIIUX3F3KAEJA22LC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Forbidden subset sums in a linear range: an inverse theorem and the Erd\\H{o}s-Graham irregularity problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NT"],"primary_cat":"math.CO","authors_text":"Mateo Matijasevick","submitted_at":"2026-11-12T18:05:45Z","abstract_excerpt":"For $c>0$ let $f_c(n)$ be the largest size of a set $A\\subseteq\\{1,\\dots,\\lfloor cn\\rfloor\\}$ such that $n$ is not a sum of distinct elements of $A$. Erd\\H{o}s and Graham asked whether $f_c(n)$ depends on $n$ in an irregular way (Erd\\H{o}s Problem \\#361). We prove that $f_c(n)=\\lfloor cn\\rfloor-\\lceil n/2\\rceil$ for $c\\ge 1$, while for $0<c<1$ the ratio $f_c(n)/n$ has $\\limsup$ equal to $c/2$, attained along odd $n$, and, along the integers $n$ whose least non-divisor equals a prime power $q$, tends to \\[ \\max\\Bigl\\{\\frac cq,\\; c-\\frac12+\\frac{1-c}{q}\\Bigr\\} \\qquad\\text{whenever } 2^{q-2}\\min\\"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2611.17205","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2611.17205/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"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-11-13T06:32:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2rhun4GZQIWh8NLp6TqXkM7D1POiLANrPbQ2e8eeD8q20Q7F/VDq5CaKKzUNNAV4/yhZPaLjyJTPo+lVkWkbBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-11-16T03:05:02.908512Z"},"content_sha256":"794919e48e6fde14c76e312493c087b20635eb97f3cc3c7f5921c09b14222b59","schema_version":"1.0","event_id":"sha256:794919e48e6fde14c76e312493c087b20635eb97f3cc3c7f5921c09b14222b59"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GS6EFXBGDCIIUX3F3KAEJA22LC/bundle.json","state_url":"https://pith.science/pith/GS6EFXBGDCIIUX3F3KAEJA22LC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GS6EFXBGDCIIUX3F3KAEJA22LC/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-11-16T03:05:02Z","links":{"resolver":"https://pith.science/pith/GS6EFXBGDCIIUX3F3KAEJA22LC","bundle":"https://pith.science/pith/GS6EFXBGDCIIUX3F3KAEJA22LC/bundle.json","state":"https://pith.science/pith/GS6EFXBGDCIIUX3F3KAEJA22LC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GS6EFXBGDCIIUX3F3KAEJA22LC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:GS6EFXBGDCIIUX3F3KAEJA22LC","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":"4d21dc7d8b9d0a8a27c72884e48780e2d85573ecdda9ef401ff594b04c5d9dc3","cross_cats_sorted":["math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-11-12T18:05:45Z","title_canon_sha256":"742c773db8dfc3c176b37e1869c9bbafac1513b76c9b9d2ba89bdd4c263226dd"},"schema_version":"1.0","source":{"id":"2611.17205","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2611.17205","created_at":"2026-11-13T06:32:42Z"},{"alias_kind":"arxiv_version","alias_value":"2611.17205v1","created_at":"2026-11-13T06:32:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2611.17205","created_at":"2026-11-13T06:32:42Z"},{"alias_kind":"pith_short_12","alias_value":"GS6EFXBGDCII","created_at":"2026-11-13T06:32:42Z"},{"alias_kind":"pith_short_16","alias_value":"GS6EFXBGDCIIUX3F","created_at":"2026-11-13T06:32:42Z"},{"alias_kind":"pith_short_8","alias_value":"GS6EFXBG","created_at":"2026-11-13T06:32:42Z"}],"graph_snapshots":[{"event_id":"sha256:794919e48e6fde14c76e312493c087b20635eb97f3cc3c7f5921c09b14222b59","target":"graph","created_at":"2026-11-13T06:32:42Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2611.17205/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"For $c>0$ let $f_c(n)$ be the largest size of a set $A\\subseteq\\{1,\\dots,\\lfloor cn\\rfloor\\}$ such that $n$ is not a sum of distinct elements of $A$. Erd\\H{o}s and Graham asked whether $f_c(n)$ depends on $n$ in an irregular way (Erd\\H{o}s Problem \\#361). We prove that $f_c(n)=\\lfloor cn\\rfloor-\\lceil n/2\\rceil$ for $c\\ge 1$, while for $0<c<1$ the ratio $f_c(n)/n$ has $\\limsup$ equal to $c/2$, attained along odd $n$, and, along the integers $n$ whose least non-divisor equals a prime power $q$, tends to \\[ \\max\\Bigl\\{\\frac cq,\\; c-\\frac12+\\frac{1-c}{q}\\Bigr\\} \\qquad\\text{whenever } 2^{q-2}\\min\\","authors_text":"Mateo Matijasevick","cross_cats":["math.NT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-11-12T18:05:45Z","title":"Forbidden subset sums in a linear range: an inverse theorem and the Erd\\H{o}s-Graham irregularity problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2611.17205","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:87dd82d8550e65cb7663bd7b4503dfdc7c3ad78ae32f384ae87e23e2717423d9","target":"record","created_at":"2026-11-13T06:32:42Z","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":"4d21dc7d8b9d0a8a27c72884e48780e2d85573ecdda9ef401ff594b04c5d9dc3","cross_cats_sorted":["math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-11-12T18:05:45Z","title_canon_sha256":"742c773db8dfc3c176b37e1869c9bbafac1513b76c9b9d2ba89bdd4c263226dd"},"schema_version":"1.0","source":{"id":"2611.17205","kind":"arxiv","version":1}},"canonical_sha256":"34bc42dc2618908a5f65da8044835a58b369b788461037fbfdbe00104cde7ecb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"34bc42dc2618908a5f65da8044835a58b369b788461037fbfdbe00104cde7ecb","first_computed_at":"2026-11-13T06:32:42.067045Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-11-13T06:32:42.067045Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9XUbzcDCiWU+6d2x9hHP21LaRUHhBYpXBwYULSS/nBfEqmttu5i4lN9ApOEyDv3fltYWsqf4ZygkP1dMpG9dBg==","signature_status":"signed_v1","signed_at":"2026-11-13T06:32:42.069374Z","signed_message":"canonical_sha256_bytes"},"source_id":"2611.17205","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:87dd82d8550e65cb7663bd7b4503dfdc7c3ad78ae32f384ae87e23e2717423d9","sha256:794919e48e6fde14c76e312493c087b20635eb97f3cc3c7f5921c09b14222b59"],"state_sha256":"8dca1eec1f6475a1476259afd4c29971284bf4c2d21a45e0b5271ba963b08fa3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D/UcPPVqSpX0C7VFAqJOjj0j/jGGF206eC4gYIOqF1Sg3j6LpnIVrZqX1f0tYGduZuKl0iawXeaq4vnjOSYKBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-11-16T03:05:02.912221Z","bundle_sha256":"8e4c5fe5eb5bd291dd884a69ace2bad95d7a77fc9ac3010c9263c67b1dc63a45"}}