{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:ZTOFIJY4B3AKVSRBVQ4FFHA3LR","short_pith_number":"pith:ZTOFIJY4","canonical_record":{"source":{"id":"1908.05220","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-14T16:45:32Z","cross_cats_sorted":["math.NT"],"title_canon_sha256":"7b146f8f9c26ab089cf97c5f2fc50a14c66ac1e8f70d5d957471761005d8b9f4","abstract_canon_sha256":"74c34e9c31525a9336326fbb7bad6e9c7130d83b7e17888308aaf78107e3bf4b"},"schema_version":"1.0"},"canonical_sha256":"ccdc54271c0ec0aaca21ac38529c1b5c4ef4fae27b2e6c4b36b8bb00cf2612dd","source":{"kind":"arxiv","id":"1908.05220","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.05220","created_at":"2026-07-05T09:09:47Z"},{"alias_kind":"arxiv_version","alias_value":"1908.05220v1","created_at":"2026-07-05T09:09:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.05220","created_at":"2026-07-05T09:09:47Z"},{"alias_kind":"pith_short_12","alias_value":"ZTOFIJY4B3AK","created_at":"2026-07-05T09:09:47Z"},{"alias_kind":"pith_short_16","alias_value":"ZTOFIJY4B3AKVSRB","created_at":"2026-07-05T09:09:47Z"},{"alias_kind":"pith_short_8","alias_value":"ZTOFIJY4","created_at":"2026-07-05T09:09:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:ZTOFIJY4B3AKVSRBVQ4FFHA3LR","target":"record","payload":{"canonical_record":{"source":{"id":"1908.05220","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-14T16:45:32Z","cross_cats_sorted":["math.NT"],"title_canon_sha256":"7b146f8f9c26ab089cf97c5f2fc50a14c66ac1e8f70d5d957471761005d8b9f4","abstract_canon_sha256":"74c34e9c31525a9336326fbb7bad6e9c7130d83b7e17888308aaf78107e3bf4b"},"schema_version":"1.0"},"canonical_sha256":"ccdc54271c0ec0aaca21ac38529c1b5c4ef4fae27b2e6c4b36b8bb00cf2612dd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:09:47.744015Z","signature_b64":"f+NJb6/iQ/UOD5n3GGFHfEcsNuuxOJy4CCE39HOtHxwg5XigN1equhyploAAilzOzMRNDkbati5tV9VCwfVECA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ccdc54271c0ec0aaca21ac38529c1b5c4ef4fae27b2e6c4b36b8bb00cf2612dd","last_reissued_at":"2026-07-05T09:09:47.743571Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:09:47.743571Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1908.05220","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-07-05T09:09:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nG6fIZxeHjZaEcaFLHRXMe/650pVL8HFTNHuc+jFzkiyUgcQIBiCh8bJpNl5yS249hmSGMHOarizJ3KGYfUFBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T05:02:11.550411Z"},"content_sha256":"c6ea6ec1ddc0aec536f45fa8465fa0d27384f64a39265826de25973f899dc543","schema_version":"1.0","event_id":"sha256:c6ea6ec1ddc0aec536f45fa8465fa0d27384f64a39265826de25973f899dc543"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:ZTOFIJY4B3AKVSRBVQ4FFHA3LR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Maximally additively reducible subsets of the integers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NT"],"primary_cat":"math.CO","authors_text":"Gal Gross","submitted_at":"2019-08-14T16:45:32Z","abstract_excerpt":"Let $A, B \\subseteq \\mathbb{N}$ be two finite sets of natural numbers. We say that $B$ is an additive divisor for $A$ if there exists some $C \\subseteq \\mathbb{N}$ with $A = B+C$. We prove that among those subsets of $\\{0, 1, \\ldots, k\\}$ which have $0$ as an element, the full interval $\\{0, 1, \\ldots,k\\}$ has the most divisors. To generalize to sets which do not have $0$ as an element, we prove a correspondence between additive divisors and lunar multiplication, introduced by Appelgate, LeBrun and Sloane (2011) in their study of a kind of min/max arithmetic. The number of binary lunar divisor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.05220","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/1908.05220/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T09:09:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fLm2zGtNV/s4CxC43qc55KFQVYnvIfyug1E5BCvYIuvzWJ7E2Rb3PuM+pmeCHYV73NqHUWBz/fD2F7RG0pgXAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T05:02:11.550944Z"},"content_sha256":"65994c72f36119cde56dd0232cbb7be61dbae39e0258d03e12774224d4827529","schema_version":"1.0","event_id":"sha256:65994c72f36119cde56dd0232cbb7be61dbae39e0258d03e12774224d4827529"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZTOFIJY4B3AKVSRBVQ4FFHA3LR/bundle.json","state_url":"https://pith.science/pith/ZTOFIJY4B3AKVSRBVQ4FFHA3LR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZTOFIJY4B3AKVSRBVQ4FFHA3LR/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-08-16T05:02:11Z","links":{"resolver":"https://pith.science/pith/ZTOFIJY4B3AKVSRBVQ4FFHA3LR","bundle":"https://pith.science/pith/ZTOFIJY4B3AKVSRBVQ4FFHA3LR/bundle.json","state":"https://pith.science/pith/ZTOFIJY4B3AKVSRBVQ4FFHA3LR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZTOFIJY4B3AKVSRBVQ4FFHA3LR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:ZTOFIJY4B3AKVSRBVQ4FFHA3LR","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":"74c34e9c31525a9336326fbb7bad6e9c7130d83b7e17888308aaf78107e3bf4b","cross_cats_sorted":["math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-14T16:45:32Z","title_canon_sha256":"7b146f8f9c26ab089cf97c5f2fc50a14c66ac1e8f70d5d957471761005d8b9f4"},"schema_version":"1.0","source":{"id":"1908.05220","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.05220","created_at":"2026-07-05T09:09:47Z"},{"alias_kind":"arxiv_version","alias_value":"1908.05220v1","created_at":"2026-07-05T09:09:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.05220","created_at":"2026-07-05T09:09:47Z"},{"alias_kind":"pith_short_12","alias_value":"ZTOFIJY4B3AK","created_at":"2026-07-05T09:09:47Z"},{"alias_kind":"pith_short_16","alias_value":"ZTOFIJY4B3AKVSRB","created_at":"2026-07-05T09:09:47Z"},{"alias_kind":"pith_short_8","alias_value":"ZTOFIJY4","created_at":"2026-07-05T09:09:47Z"}],"graph_snapshots":[{"event_id":"sha256:65994c72f36119cde56dd0232cbb7be61dbae39e0258d03e12774224d4827529","target":"graph","created_at":"2026-07-05T09:09:47Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1908.05220/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Let $A, B \\subseteq \\mathbb{N}$ be two finite sets of natural numbers. We say that $B$ is an additive divisor for $A$ if there exists some $C \\subseteq \\mathbb{N}$ with $A = B+C$. We prove that among those subsets of $\\{0, 1, \\ldots, k\\}$ which have $0$ as an element, the full interval $\\{0, 1, \\ldots,k\\}$ has the most divisors. To generalize to sets which do not have $0$ as an element, we prove a correspondence between additive divisors and lunar multiplication, introduced by Appelgate, LeBrun and Sloane (2011) in their study of a kind of min/max arithmetic. The number of binary lunar divisor","authors_text":"Gal Gross","cross_cats":["math.NT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-14T16:45:32Z","title":"Maximally additively reducible subsets of the integers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.05220","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:c6ea6ec1ddc0aec536f45fa8465fa0d27384f64a39265826de25973f899dc543","target":"record","created_at":"2026-07-05T09:09:47Z","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":"74c34e9c31525a9336326fbb7bad6e9c7130d83b7e17888308aaf78107e3bf4b","cross_cats_sorted":["math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-14T16:45:32Z","title_canon_sha256":"7b146f8f9c26ab089cf97c5f2fc50a14c66ac1e8f70d5d957471761005d8b9f4"},"schema_version":"1.0","source":{"id":"1908.05220","kind":"arxiv","version":1}},"canonical_sha256":"ccdc54271c0ec0aaca21ac38529c1b5c4ef4fae27b2e6c4b36b8bb00cf2612dd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ccdc54271c0ec0aaca21ac38529c1b5c4ef4fae27b2e6c4b36b8bb00cf2612dd","first_computed_at":"2026-07-05T09:09:47.743571Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:09:47.743571Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"f+NJb6/iQ/UOD5n3GGFHfEcsNuuxOJy4CCE39HOtHxwg5XigN1equhyploAAilzOzMRNDkbati5tV9VCwfVECA==","signature_status":"signed_v1","signed_at":"2026-07-05T09:09:47.744015Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.05220","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c6ea6ec1ddc0aec536f45fa8465fa0d27384f64a39265826de25973f899dc543","sha256:65994c72f36119cde56dd0232cbb7be61dbae39e0258d03e12774224d4827529"],"state_sha256":"33b0599faf5fe8da0a4130018047e612d827e111b3d7fac36d2badb069fc9706"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fLFBpMtYobzBQdv9AGeU2alyY26G7MY4L6gmUVoIhyWP2DY6/sCHx/WdMIBJcRCxFvhDIdzBwA7TYbn4XGFtAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T05:02:11.556366Z","bundle_sha256":"7371705666c4c9db1ff36a93f57b2022fb7d94cd9a57fb99d2f86b97bf702eed"}}