{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:SJZTFKN3GTZKDEITRBQJLG6GZS","short_pith_number":"pith:SJZTFKN3","schema_version":"1.0","canonical_sha256":"927332a9bb34f2a191138860959bc6cc9f2feda38a5ae2a2a3fe6006650e188d","source":{"kind":"arxiv","id":"1012.3918","version":1},"attestation_state":"computed","paper":{"title":"Large B_d-free and union-free subfamilies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bal\\'azs Patk\\'os, Ida Kantor, J\\'anos Bar\\'at, Younjin Kim, Zolt\\'an F\\\"uredi","submitted_at":"2010-12-17T16:33:32Z","abstract_excerpt":"For a property $\\Gamma$ and a family of sets $\\cF$, let $f(\\cF,\\Gamma)$ be the size of the largest subfamily of $\\cF$ having property $\\Gamma$. For a positive integer $m$, let $f(m,\\Gamma)$ be the minimum of $f(\\cF,\\Gamma)$ over all families of size $m$. A family $\\cF$ is said to be $B_d$-free if it has no subfamily $\\cF'=\\{F_I: I \\subseteq [d]\\}$ of $2^d$ distinct sets such that for every $I,J \\subseteq [d]$, both $F_I \\cup F_J=F_{I \\cup J}$ and $F_I \\cap F_J = F_{I \\cap J}$ hold. A family $\\cF$ is $a$-union free if $F_1\\cup ... F_a \\neq F_{a+1}$ whenever $F_1,..,F_{a+1}$ are distinct sets in"},"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":"1012.3918","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-12-17T16:33:32Z","cross_cats_sorted":[],"title_canon_sha256":"09c58931f1020e756b9ae3ed18473692fc87c7fa3aa9f31621d2b8d56c556d82","abstract_canon_sha256":"5fb0a30ac994f5540f1f98fa3456bb9cd652e3fad4c7f450a13bf21139cce1ab"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:33:03.648814Z","signature_b64":"YqgbCqb3feTP0rNtP7vaiFGvwKyHe6eqgLV9fmHFrHAbfucmap4Bp0/QAR2qTwa77f2nNLQJR5e43Mn2rDreAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"927332a9bb34f2a191138860959bc6cc9f2feda38a5ae2a2a3fe6006650e188d","last_reissued_at":"2026-05-18T04:33:03.648166Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:33:03.648166Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Large B_d-free and union-free subfamilies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bal\\'azs Patk\\'os, Ida Kantor, J\\'anos Bar\\'at, Younjin Kim, Zolt\\'an F\\\"uredi","submitted_at":"2010-12-17T16:33:32Z","abstract_excerpt":"For a property $\\Gamma$ and a family of sets $\\cF$, let $f(\\cF,\\Gamma)$ be the size of the largest subfamily of $\\cF$ having property $\\Gamma$. For a positive integer $m$, let $f(m,\\Gamma)$ be the minimum of $f(\\cF,\\Gamma)$ over all families of size $m$. A family $\\cF$ is said to be $B_d$-free if it has no subfamily $\\cF'=\\{F_I: I \\subseteq [d]\\}$ of $2^d$ distinct sets such that for every $I,J \\subseteq [d]$, both $F_I \\cup F_J=F_{I \\cup J}$ and $F_I \\cap F_J = F_{I \\cap J}$ hold. A family $\\cF$ is $a$-union free if $F_1\\cup ... F_a \\neq F_{a+1}$ whenever $F_1,..,F_{a+1}$ are distinct sets in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.3918","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":""},"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":"1012.3918","created_at":"2026-05-18T04:33:03.648267+00:00"},{"alias_kind":"arxiv_version","alias_value":"1012.3918v1","created_at":"2026-05-18T04:33:03.648267+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.3918","created_at":"2026-05-18T04:33:03.648267+00:00"},{"alias_kind":"pith_short_12","alias_value":"SJZTFKN3GTZK","created_at":"2026-05-18T12:26:13.927090+00:00"},{"alias_kind":"pith_short_16","alias_value":"SJZTFKN3GTZKDEIT","created_at":"2026-05-18T12:26:13.927090+00:00"},{"alias_kind":"pith_short_8","alias_value":"SJZTFKN3","created_at":"2026-05-18T12:26:13.927090+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/SJZTFKN3GTZKDEITRBQJLG6GZS","json":"https://pith.science/pith/SJZTFKN3GTZKDEITRBQJLG6GZS.json","graph_json":"https://pith.science/api/pith-number/SJZTFKN3GTZKDEITRBQJLG6GZS/graph.json","events_json":"https://pith.science/api/pith-number/SJZTFKN3GTZKDEITRBQJLG6GZS/events.json","paper":"https://pith.science/paper/SJZTFKN3"},"agent_actions":{"view_html":"https://pith.science/pith/SJZTFKN3GTZKDEITRBQJLG6GZS","download_json":"https://pith.science/pith/SJZTFKN3GTZKDEITRBQJLG6GZS.json","view_paper":"https://pith.science/paper/SJZTFKN3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1012.3918&json=true","fetch_graph":"https://pith.science/api/pith-number/SJZTFKN3GTZKDEITRBQJLG6GZS/graph.json","fetch_events":"https://pith.science/api/pith-number/SJZTFKN3GTZKDEITRBQJLG6GZS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SJZTFKN3GTZKDEITRBQJLG6GZS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SJZTFKN3GTZKDEITRBQJLG6GZS/action/storage_attestation","attest_author":"https://pith.science/pith/SJZTFKN3GTZKDEITRBQJLG6GZS/action/author_attestation","sign_citation":"https://pith.science/pith/SJZTFKN3GTZKDEITRBQJLG6GZS/action/citation_signature","submit_replication":"https://pith.science/pith/SJZTFKN3GTZKDEITRBQJLG6GZS/action/replication_record"}},"created_at":"2026-05-18T04:33:03.648267+00:00","updated_at":"2026-05-18T04:33:03.648267+00:00"}