{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:CIGRGLLJE2A3PXRQCRWP4U5VWG","short_pith_number":"pith:CIGRGLLJ","schema_version":"1.0","canonical_sha256":"120d132d692681b7de30146cfe53b5b1a86678d490da6e52e66aaf2b21dc6959","source":{"kind":"arxiv","id":"1511.03828","version":2},"attestation_state":"computed","paper":{"title":"Multiply union families in $\\mathbb{N}^n$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Masashi Shinohara, Norihide Tokushige, Peter Frankl","submitted_at":"2015-11-12T09:26:14Z","abstract_excerpt":"Let $A\\subset \\mathbb{N}^{n}$ be an $r$-wise $s$-union family, that is, a family of sequences with $n$ components of non-negative integers such that for any $r$ sequences in $A$ the total sum of the maximum of each component in those sequences is at most $s$. We determine the maximum size of $A$ and its unique extremal configuration provided (i) $n$ is sufficiently large for fixed $r$ and $s$, or (ii) $n=r+1$."},"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":"1511.03828","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-11-12T09:26:14Z","cross_cats_sorted":[],"title_canon_sha256":"6008f7f7c050344f08101362d6a6a0f9daf1c4ac577658d178498cbfce240f87","abstract_canon_sha256":"f18b79acd9ccfdf1a76e910c3e5ff7b9335dbd4c1d4a1c9f846c621d59fd6c34"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:13:04.852953Z","signature_b64":"FkDMR5v7IXT9p4Cl19Ogi79hjwxWU/iHEKNbqkXXNi1l5isScBPP512g/tIkH+7rUJGzQN2jM7iY78ZRe+IyAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"120d132d692681b7de30146cfe53b5b1a86678d490da6e52e66aaf2b21dc6959","last_reissued_at":"2026-05-18T01:13:04.852600Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:13:04.852600Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multiply union families in $\\mathbb{N}^n$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Masashi Shinohara, Norihide Tokushige, Peter Frankl","submitted_at":"2015-11-12T09:26:14Z","abstract_excerpt":"Let $A\\subset \\mathbb{N}^{n}$ be an $r$-wise $s$-union family, that is, a family of sequences with $n$ components of non-negative integers such that for any $r$ sequences in $A$ the total sum of the maximum of each component in those sequences is at most $s$. We determine the maximum size of $A$ and its unique extremal configuration provided (i) $n$ is sufficiently large for fixed $r$ and $s$, or (ii) $n=r+1$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.03828","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":"1511.03828","created_at":"2026-05-18T01:13:04.852655+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.03828v2","created_at":"2026-05-18T01:13:04.852655+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.03828","created_at":"2026-05-18T01:13:04.852655+00:00"},{"alias_kind":"pith_short_12","alias_value":"CIGRGLLJE2A3","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_16","alias_value":"CIGRGLLJE2A3PXRQ","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_8","alias_value":"CIGRGLLJ","created_at":"2026-05-18T12:29:14.074870+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/CIGRGLLJE2A3PXRQCRWP4U5VWG","json":"https://pith.science/pith/CIGRGLLJE2A3PXRQCRWP4U5VWG.json","graph_json":"https://pith.science/api/pith-number/CIGRGLLJE2A3PXRQCRWP4U5VWG/graph.json","events_json":"https://pith.science/api/pith-number/CIGRGLLJE2A3PXRQCRWP4U5VWG/events.json","paper":"https://pith.science/paper/CIGRGLLJ"},"agent_actions":{"view_html":"https://pith.science/pith/CIGRGLLJE2A3PXRQCRWP4U5VWG","download_json":"https://pith.science/pith/CIGRGLLJE2A3PXRQCRWP4U5VWG.json","view_paper":"https://pith.science/paper/CIGRGLLJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.03828&json=true","fetch_graph":"https://pith.science/api/pith-number/CIGRGLLJE2A3PXRQCRWP4U5VWG/graph.json","fetch_events":"https://pith.science/api/pith-number/CIGRGLLJE2A3PXRQCRWP4U5VWG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CIGRGLLJE2A3PXRQCRWP4U5VWG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CIGRGLLJE2A3PXRQCRWP4U5VWG/action/storage_attestation","attest_author":"https://pith.science/pith/CIGRGLLJE2A3PXRQCRWP4U5VWG/action/author_attestation","sign_citation":"https://pith.science/pith/CIGRGLLJE2A3PXRQCRWP4U5VWG/action/citation_signature","submit_replication":"https://pith.science/pith/CIGRGLLJE2A3PXRQCRWP4U5VWG/action/replication_record"}},"created_at":"2026-05-18T01:13:04.852655+00:00","updated_at":"2026-05-18T01:13:04.852655+00:00"}