{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:SWWHISTIG5HDOSEY25RDLW3ZMC","short_pith_number":"pith:SWWHISTI","canonical_record":{"source":{"id":"1901.02652","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-01-09T09:59:25Z","cross_cats_sorted":[],"title_canon_sha256":"e1ef87b61d8fbeecdafff3b560e52e08fcc7be03f1acb374eec32e22732c4471","abstract_canon_sha256":"dc3d2eae32760d48d73fd2a8de5f484ca03c2565ca3d29311d4ef230e55284a4"},"schema_version":"1.0"},"canonical_sha256":"95ac744a68374e374898d76235db79608da0ac49e2c4e1337da4743456dee34e","source":{"kind":"arxiv","id":"1901.02652","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.02652","created_at":"2026-05-17T23:56:39Z"},{"alias_kind":"arxiv_version","alias_value":"1901.02652v1","created_at":"2026-05-17T23:56:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.02652","created_at":"2026-05-17T23:56:39Z"},{"alias_kind":"pith_short_12","alias_value":"SWWHISTIG5HD","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"SWWHISTIG5HDOSEY","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"SWWHISTI","created_at":"2026-05-18T12:33:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:SWWHISTIG5HDOSEY25RDLW3ZMC","target":"record","payload":{"canonical_record":{"source":{"id":"1901.02652","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-01-09T09:59:25Z","cross_cats_sorted":[],"title_canon_sha256":"e1ef87b61d8fbeecdafff3b560e52e08fcc7be03f1acb374eec32e22732c4471","abstract_canon_sha256":"dc3d2eae32760d48d73fd2a8de5f484ca03c2565ca3d29311d4ef230e55284a4"},"schema_version":"1.0"},"canonical_sha256":"95ac744a68374e374898d76235db79608da0ac49e2c4e1337da4743456dee34e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:39.883885Z","signature_b64":"R6cfpIRvCoSlmEi5VMwiylHp5oyPys1tudfiyEj7zv4EZltFzhs4ztM0Dlgj+zsUT3ORh+kEi7efOwpRyj+FBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"95ac744a68374e374898d76235db79608da0ac49e2c4e1337da4743456dee34e","last_reissued_at":"2026-05-17T23:56:39.883311Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:39.883311Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.02652","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:56:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cL2udQzeP5KMZXEDrfUvUGin8qtgE3pVuFusPpyR4/ul+KZMO4S1RQJwlTpiys1hCe4xGs0ai5pBTBStIWQwAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T03:58:55.053153Z"},"content_sha256":"2d517077477bf2b8238baf99b42274547f259dc87ff103015879482aa7a9e293","schema_version":"1.0","event_id":"sha256:2d517077477bf2b8238baf99b42274547f259dc87ff103015879482aa7a9e293"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:SWWHISTIG5HDOSEY25RDLW3ZMC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"$d$-Galvin families","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Guillaume Lagarde, Johan H{\\aa}stad, Joseph Swernofsky","submitted_at":"2019-01-09T09:59:25Z","abstract_excerpt":"The Galvin problem asks for the minimum size of a family $\\mathcal{F} \\subseteq \\binom{[n]}{n/2}$ with the property that, for any set $A$ of size $\\frac n 2$, there is a set $S \\in \\mathcal{F}$ which is balanced on $A$, meaning that $|S \\cap A| = |S \\cap \\overline{A}|$. We consider a generalization of this question that comes from a possible approach in complexity theory. In the generalization the required property is, for any $A$, to be able to find $d$ sets from a family $\\mathcal{F} \\subseteq \\binom{[n]}{n/d}$ that form a partition of $[n]$ and such that each part is balanced on $A$. We con"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.02652","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:56:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Bg0s0VOwNPtPra1IQg0AQ0iVOP4u2lhlNeEfqAgupXSonExSokfjeHNJrb03/uSwkkREOYE9jxCEZDbHgeAOAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T03:58:55.053528Z"},"content_sha256":"e04f097ea884fa7d71cb3ab11853565a0ed4a6a4f55fccd258e25890f578083e","schema_version":"1.0","event_id":"sha256:e04f097ea884fa7d71cb3ab11853565a0ed4a6a4f55fccd258e25890f578083e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SWWHISTIG5HDOSEY25RDLW3ZMC/bundle.json","state_url":"https://pith.science/pith/SWWHISTIG5HDOSEY25RDLW3ZMC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SWWHISTIG5HDOSEY25RDLW3ZMC/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-30T03:58:55Z","links":{"resolver":"https://pith.science/pith/SWWHISTIG5HDOSEY25RDLW3ZMC","bundle":"https://pith.science/pith/SWWHISTIG5HDOSEY25RDLW3ZMC/bundle.json","state":"https://pith.science/pith/SWWHISTIG5HDOSEY25RDLW3ZMC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SWWHISTIG5HDOSEY25RDLW3ZMC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:SWWHISTIG5HDOSEY25RDLW3ZMC","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"dc3d2eae32760d48d73fd2a8de5f484ca03c2565ca3d29311d4ef230e55284a4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-01-09T09:59:25Z","title_canon_sha256":"e1ef87b61d8fbeecdafff3b560e52e08fcc7be03f1acb374eec32e22732c4471"},"schema_version":"1.0","source":{"id":"1901.02652","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.02652","created_at":"2026-05-17T23:56:39Z"},{"alias_kind":"arxiv_version","alias_value":"1901.02652v1","created_at":"2026-05-17T23:56:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.02652","created_at":"2026-05-17T23:56:39Z"},{"alias_kind":"pith_short_12","alias_value":"SWWHISTIG5HD","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"SWWHISTIG5HDOSEY","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"SWWHISTI","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:e04f097ea884fa7d71cb3ab11853565a0ed4a6a4f55fccd258e25890f578083e","target":"graph","created_at":"2026-05-17T23:56:39Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"The Galvin problem asks for the minimum size of a family $\\mathcal{F} \\subseteq \\binom{[n]}{n/2}$ with the property that, for any set $A$ of size $\\frac n 2$, there is a set $S \\in \\mathcal{F}$ which is balanced on $A$, meaning that $|S \\cap A| = |S \\cap \\overline{A}|$. We consider a generalization of this question that comes from a possible approach in complexity theory. In the generalization the required property is, for any $A$, to be able to find $d$ sets from a family $\\mathcal{F} \\subseteq \\binom{[n]}{n/d}$ that form a partition of $[n]$ and such that each part is balanced on $A$. We con","authors_text":"Guillaume Lagarde, Johan H{\\aa}stad, Joseph Swernofsky","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-01-09T09:59:25Z","title":"$d$-Galvin families"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.02652","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:2d517077477bf2b8238baf99b42274547f259dc87ff103015879482aa7a9e293","target":"record","created_at":"2026-05-17T23:56:39Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"dc3d2eae32760d48d73fd2a8de5f484ca03c2565ca3d29311d4ef230e55284a4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-01-09T09:59:25Z","title_canon_sha256":"e1ef87b61d8fbeecdafff3b560e52e08fcc7be03f1acb374eec32e22732c4471"},"schema_version":"1.0","source":{"id":"1901.02652","kind":"arxiv","version":1}},"canonical_sha256":"95ac744a68374e374898d76235db79608da0ac49e2c4e1337da4743456dee34e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"95ac744a68374e374898d76235db79608da0ac49e2c4e1337da4743456dee34e","first_computed_at":"2026-05-17T23:56:39.883311Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:56:39.883311Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"R6cfpIRvCoSlmEi5VMwiylHp5oyPys1tudfiyEj7zv4EZltFzhs4ztM0Dlgj+zsUT3ORh+kEi7efOwpRyj+FBw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:56:39.883885Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.02652","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2d517077477bf2b8238baf99b42274547f259dc87ff103015879482aa7a9e293","sha256:e04f097ea884fa7d71cb3ab11853565a0ed4a6a4f55fccd258e25890f578083e"],"state_sha256":"af0dd5dee48ef23b2cb188d0644bcbc97a070182957e2d2d56a0db3ff891fcc1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rR0T+XIKb92sjLxz1kp0LnajTLqujx7cebjpbjJTt7v2qIwrrASGsOVyHyGpoNwLHRahYg3ziyC8vNAtbI9UBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T03:58:55.055854Z","bundle_sha256":"cff0954d61f5eedf24838f047a1c4f0e1f11bd8dca4f6915eebc1bd3c67d1eef"}}