{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:1994:VLGEQ6XZWO3LP4GHF3XCKJXMWW","short_pith_number":"pith:VLGEQ6XZ","schema_version":"1.0","canonical_sha256":"aacc487af9b3b6b7f0c72eee2526ecb5b1fb89df60327875a867f680d2df63bb","source":{"kind":"arxiv","id":"math/9409215","version":1},"attestation_state":"computed","paper":{"title":"Graph generated union-closed families of sets","license":"","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Emanuel Knill","submitted_at":"1994-09-16T00:00:00Z","abstract_excerpt":"Let G be a graph with vertices V and edges E. Let F be the union-closed family of sets generated by E. Then F is the family of subsets of V without isolated points. Theorem: There is an edge e belongs to E such that |{U belongs to F | e belongs to U}| =< 1/2|F|. This is equivalent to the following assertion: If H is a union-closed family generated by a family of sets of maximum degree two, then there is an $x$ such that |{U belongs to H | x belongs to U}| > 1/2|H|. This is a special case of the union-closed sets conjecture. To put this result in perspective, a brief overview of research on the"},"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":"math/9409215","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.CO","submitted_at":"1994-09-16T00:00:00Z","cross_cats_sorted":[],"title_canon_sha256":"29563210986573c49f2203b65977123614b79ded34c6c90533a374eba518aa48","abstract_canon_sha256":"857747e1a4efd62d9a2bd603f0f9a2858354aa28b7195d222a6d026914b5ae7c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:05:51.097350Z","signature_b64":"mHOtOQN2BF2WuXuojg9I7hrSF/Ko8AKkKudbf0c6ppgs7OJCsS5U35pxnsTQPMtq/mNdA44ZPobeiaMs7KIuDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aacc487af9b3b6b7f0c72eee2526ecb5b1fb89df60327875a867f680d2df63bb","last_reissued_at":"2026-05-18T01:05:51.096878Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:05:51.096878Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph generated union-closed families of sets","license":"","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Emanuel Knill","submitted_at":"1994-09-16T00:00:00Z","abstract_excerpt":"Let G be a graph with vertices V and edges E. Let F be the union-closed family of sets generated by E. Then F is the family of subsets of V without isolated points. Theorem: There is an edge e belongs to E such that |{U belongs to F | e belongs to U}| =< 1/2|F|. This is equivalent to the following assertion: If H is a union-closed family generated by a family of sets of maximum degree two, then there is an $x$ such that |{U belongs to H | x belongs to U}| > 1/2|H|. This is a special case of the union-closed sets conjecture. To put this result in perspective, a brief overview of research on the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/9409215","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":"math/9409215","created_at":"2026-05-18T01:05:51.096952+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/9409215v1","created_at":"2026-05-18T01:05:51.096952+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/9409215","created_at":"2026-05-18T01:05:51.096952+00:00"},{"alias_kind":"pith_short_12","alias_value":"VLGEQ6XZWO3L","created_at":"2026-05-18T12:25:47.102015+00:00"},{"alias_kind":"pith_short_16","alias_value":"VLGEQ6XZWO3LP4GH","created_at":"2026-05-18T12:25:47.102015+00:00"},{"alias_kind":"pith_short_8","alias_value":"VLGEQ6XZ","created_at":"2026-05-18T12:25:47.102015+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.03451","citing_title":"Redundancy Is All You Need (for CSP Sparsification)","ref_index":23,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VLGEQ6XZWO3LP4GHF3XCKJXMWW","json":"https://pith.science/pith/VLGEQ6XZWO3LP4GHF3XCKJXMWW.json","graph_json":"https://pith.science/api/pith-number/VLGEQ6XZWO3LP4GHF3XCKJXMWW/graph.json","events_json":"https://pith.science/api/pith-number/VLGEQ6XZWO3LP4GHF3XCKJXMWW/events.json","paper":"https://pith.science/paper/VLGEQ6XZ"},"agent_actions":{"view_html":"https://pith.science/pith/VLGEQ6XZWO3LP4GHF3XCKJXMWW","download_json":"https://pith.science/pith/VLGEQ6XZWO3LP4GHF3XCKJXMWW.json","view_paper":"https://pith.science/paper/VLGEQ6XZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/9409215&json=true","fetch_graph":"https://pith.science/api/pith-number/VLGEQ6XZWO3LP4GHF3XCKJXMWW/graph.json","fetch_events":"https://pith.science/api/pith-number/VLGEQ6XZWO3LP4GHF3XCKJXMWW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VLGEQ6XZWO3LP4GHF3XCKJXMWW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VLGEQ6XZWO3LP4GHF3XCKJXMWW/action/storage_attestation","attest_author":"https://pith.science/pith/VLGEQ6XZWO3LP4GHF3XCKJXMWW/action/author_attestation","sign_citation":"https://pith.science/pith/VLGEQ6XZWO3LP4GHF3XCKJXMWW/action/citation_signature","submit_replication":"https://pith.science/pith/VLGEQ6XZWO3LP4GHF3XCKJXMWW/action/replication_record"}},"created_at":"2026-05-18T01:05:51.096952+00:00","updated_at":"2026-05-18T01:05:51.096952+00:00"}