{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:IRFWHQKTQFXDOZH75AMNJ2TVDB","short_pith_number":"pith:IRFWHQKT","schema_version":"1.0","canonical_sha256":"444b63c153816e3764ffe818d4ea75185296e3245aacf0774f988db574bfe6cb","source":{"kind":"arxiv","id":"2404.14178","version":3},"attestation_state":"computed","paper":{"title":"Non-trivial $r$-wise agreeing families","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrey Kupavskii, Peter Frankl","submitted_at":"2024-04-22T13:49:43Z","abstract_excerpt":"A family of subsets of $[n]$ is $r$-wise agreeing if for any $r$ sets from the family there is an element $x$ that is either contained in all or contained in none of the $r$ sets. The study of such families is motivated by questions in discrete optimization. In this paper, we determine the size of the largest non-trivial $r$-wise agreeing family. This can be seen as a generalization of the classical Brace-Daykin theorem."},"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":"2404.14178","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-04-22T13:49:43Z","cross_cats_sorted":[],"title_canon_sha256":"7118d8d9bf038a15b1d65a118ad5e8afd26e9b4126d65dc06e1ba01aa79f1513","abstract_canon_sha256":"2726628f9fec3886c8b9ac910528c7e66ffe0709cda2668b3c8f7de760cb70aa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:46:28.379987Z","signature_b64":"eRSWWnUelcPF+s+UYMMfPZerMVVotAaKqrrwcsO2u6hNZSPMONnTjYfPP3DNHIzo2BgAzejZqye7n1NT2db1Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"444b63c153816e3764ffe818d4ea75185296e3245aacf0774f988db574bfe6cb","last_reissued_at":"2026-07-05T09:46:28.379515Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:46:28.379515Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Non-trivial $r$-wise agreeing families","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrey Kupavskii, Peter Frankl","submitted_at":"2024-04-22T13:49:43Z","abstract_excerpt":"A family of subsets of $[n]$ is $r$-wise agreeing if for any $r$ sets from the family there is an element $x$ that is either contained in all or contained in none of the $r$ sets. The study of such families is motivated by questions in discrete optimization. In this paper, we determine the size of the largest non-trivial $r$-wise agreeing family. This can be seen as a generalization of the classical Brace-Daykin theorem."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.14178","kind":"arxiv","version":3},"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/2404.14178/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2404.14178","created_at":"2026-07-05T09:46:28.379574+00:00"},{"alias_kind":"arxiv_version","alias_value":"2404.14178v3","created_at":"2026-07-05T09:46:28.379574+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.14178","created_at":"2026-07-05T09:46:28.379574+00:00"},{"alias_kind":"pith_short_12","alias_value":"IRFWHQKTQFXD","created_at":"2026-07-05T09:46:28.379574+00:00"},{"alias_kind":"pith_short_16","alias_value":"IRFWHQKTQFXDOZH7","created_at":"2026-07-05T09:46:28.379574+00:00"},{"alias_kind":"pith_short_8","alias_value":"IRFWHQKT","created_at":"2026-07-05T09:46:28.379574+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/IRFWHQKTQFXDOZH75AMNJ2TVDB","json":"https://pith.science/pith/IRFWHQKTQFXDOZH75AMNJ2TVDB.json","graph_json":"https://pith.science/api/pith-number/IRFWHQKTQFXDOZH75AMNJ2TVDB/graph.json","events_json":"https://pith.science/api/pith-number/IRFWHQKTQFXDOZH75AMNJ2TVDB/events.json","paper":"https://pith.science/paper/IRFWHQKT"},"agent_actions":{"view_html":"https://pith.science/pith/IRFWHQKTQFXDOZH75AMNJ2TVDB","download_json":"https://pith.science/pith/IRFWHQKTQFXDOZH75AMNJ2TVDB.json","view_paper":"https://pith.science/paper/IRFWHQKT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2404.14178&json=true","fetch_graph":"https://pith.science/api/pith-number/IRFWHQKTQFXDOZH75AMNJ2TVDB/graph.json","fetch_events":"https://pith.science/api/pith-number/IRFWHQKTQFXDOZH75AMNJ2TVDB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IRFWHQKTQFXDOZH75AMNJ2TVDB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IRFWHQKTQFXDOZH75AMNJ2TVDB/action/storage_attestation","attest_author":"https://pith.science/pith/IRFWHQKTQFXDOZH75AMNJ2TVDB/action/author_attestation","sign_citation":"https://pith.science/pith/IRFWHQKTQFXDOZH75AMNJ2TVDB/action/citation_signature","submit_replication":"https://pith.science/pith/IRFWHQKTQFXDOZH75AMNJ2TVDB/action/replication_record"}},"created_at":"2026-07-05T09:46:28.379574+00:00","updated_at":"2026-07-05T09:46:28.379574+00:00"}