{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:H5HLRF42OTTDKO6ZH2XWCP43YT","short_pith_number":"pith:H5HLRF42","schema_version":"1.0","canonical_sha256":"3f4eb8979a74e6353bd93eaf613f9bc4c700216026f04500df22de7e54f30f12","source":{"kind":"arxiv","id":"0802.0182","version":2},"attestation_state":"computed","paper":{"title":"On sumfree subsets of hypercubes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.NT","authors_text":"Daniel Katz","submitted_at":"2008-02-01T19:01:27Z","abstract_excerpt":"We consider the possible sizes of large sumfree sets contained in the discrete hypercube $\\{1,...,n\\}^k$, and we determine upper and lower bounds for the maximal size as $n$ becomes large. We also discuss a continuous analogue in which our lower bound remains valid and our upper bound can be strengthened, and we consider the generalization of both problems to $l$-fold-sumfree sets."},"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":"0802.0182","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2008-02-01T19:01:27Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"a978a35167490278a97e24a8581c1c7a33444fa8c9f523144007c3e88e60d871","abstract_canon_sha256":"0ef9e9cca968f14a21cc15f6119adbcef30414ab16f529eeeedd81e2d8b35134"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:16:01.379214Z","signature_b64":"RUzPdVes8pdzivUuLBpmDVvfq2lY6L7Un9/qsNzGYJNWDmCaGzASBja/45gjUknmcldKMVQzyn/zzaULC85IAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3f4eb8979a74e6353bd93eaf613f9bc4c700216026f04500df22de7e54f30f12","last_reissued_at":"2026-05-18T02:16:01.378791Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:16:01.378791Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On sumfree subsets of hypercubes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.NT","authors_text":"Daniel Katz","submitted_at":"2008-02-01T19:01:27Z","abstract_excerpt":"We consider the possible sizes of large sumfree sets contained in the discrete hypercube $\\{1,...,n\\}^k$, and we determine upper and lower bounds for the maximal size as $n$ becomes large. We also discuss a continuous analogue in which our lower bound remains valid and our upper bound can be strengthened, and we consider the generalization of both problems to $l$-fold-sumfree sets."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0802.0182","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":"0802.0182","created_at":"2026-05-18T02:16:01.378851+00:00"},{"alias_kind":"arxiv_version","alias_value":"0802.0182v2","created_at":"2026-05-18T02:16:01.378851+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0802.0182","created_at":"2026-05-18T02:16:01.378851+00:00"},{"alias_kind":"pith_short_12","alias_value":"H5HLRF42OTTD","created_at":"2026-05-18T12:25:57.157939+00:00"},{"alias_kind":"pith_short_16","alias_value":"H5HLRF42OTTDKO6Z","created_at":"2026-05-18T12:25:57.157939+00:00"},{"alias_kind":"pith_short_8","alias_value":"H5HLRF42","created_at":"2026-05-18T12:25:57.157939+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/H5HLRF42OTTDKO6ZH2XWCP43YT","json":"https://pith.science/pith/H5HLRF42OTTDKO6ZH2XWCP43YT.json","graph_json":"https://pith.science/api/pith-number/H5HLRF42OTTDKO6ZH2XWCP43YT/graph.json","events_json":"https://pith.science/api/pith-number/H5HLRF42OTTDKO6ZH2XWCP43YT/events.json","paper":"https://pith.science/paper/H5HLRF42"},"agent_actions":{"view_html":"https://pith.science/pith/H5HLRF42OTTDKO6ZH2XWCP43YT","download_json":"https://pith.science/pith/H5HLRF42OTTDKO6ZH2XWCP43YT.json","view_paper":"https://pith.science/paper/H5HLRF42","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0802.0182&json=true","fetch_graph":"https://pith.science/api/pith-number/H5HLRF42OTTDKO6ZH2XWCP43YT/graph.json","fetch_events":"https://pith.science/api/pith-number/H5HLRF42OTTDKO6ZH2XWCP43YT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H5HLRF42OTTDKO6ZH2XWCP43YT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H5HLRF42OTTDKO6ZH2XWCP43YT/action/storage_attestation","attest_author":"https://pith.science/pith/H5HLRF42OTTDKO6ZH2XWCP43YT/action/author_attestation","sign_citation":"https://pith.science/pith/H5HLRF42OTTDKO6ZH2XWCP43YT/action/citation_signature","submit_replication":"https://pith.science/pith/H5HLRF42OTTDKO6ZH2XWCP43YT/action/replication_record"}},"created_at":"2026-05-18T02:16:01.378851+00:00","updated_at":"2026-05-18T02:16:01.378851+00:00"}