{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:HJHTPACV2FRJZLZLPTHSVSDASC","short_pith_number":"pith:HJHTPACV","canonical_record":{"source":{"id":"1611.03196","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-10T06:31:33Z","cross_cats_sorted":[],"title_canon_sha256":"6c35f3f6561febb8b16a716cd63c5ea638ed95d5f64af021eaf5dea130f17a53","abstract_canon_sha256":"e093826d0ac750c8a9ce983e9243208ffd096991eb7bea17e8ab5cc096cb4690"},"schema_version":"1.0"},"canonical_sha256":"3a4f378055d1629caf2b7ccf2ac860909e585ab7989fe98764c8b16f7d166a6d","source":{"kind":"arxiv","id":"1611.03196","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.03196","created_at":"2026-05-18T00:59:41Z"},{"alias_kind":"arxiv_version","alias_value":"1611.03196v1","created_at":"2026-05-18T00:59:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.03196","created_at":"2026-05-18T00:59:41Z"},{"alias_kind":"pith_short_12","alias_value":"HJHTPACV2FRJ","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"HJHTPACV2FRJZLZL","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"HJHTPACV","created_at":"2026-05-18T12:30:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:HJHTPACV2FRJZLZLPTHSVSDASC","target":"record","payload":{"canonical_record":{"source":{"id":"1611.03196","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-10T06:31:33Z","cross_cats_sorted":[],"title_canon_sha256":"6c35f3f6561febb8b16a716cd63c5ea638ed95d5f64af021eaf5dea130f17a53","abstract_canon_sha256":"e093826d0ac750c8a9ce983e9243208ffd096991eb7bea17e8ab5cc096cb4690"},"schema_version":"1.0"},"canonical_sha256":"3a4f378055d1629caf2b7ccf2ac860909e585ab7989fe98764c8b16f7d166a6d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:41.054407Z","signature_b64":"o3bwyd37p8AobPYvIMByCAJvwsEE5KGlGaxLjjaIUz1BxH8aBFTqZC4nMqLJG/k7ym/36+yAgmKJB/H05DMPCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3a4f378055d1629caf2b7ccf2ac860909e585ab7989fe98764c8b16f7d166a6d","last_reissued_at":"2026-05-18T00:59:41.053670Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:41.053670Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.03196","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-18T00:59:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Fp2hoPSzVAqlUaQlfvi4Qo17ew6w051flky4qveBoo8zxv7GtSv2WTeelB79g6USTAUt7HAARoBsBFEJxG0XBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T12:06:20.893677Z"},"content_sha256":"c87f1830a119c20da60254ab050db24d7e0874606e7a9738c2eb63c199167a8a","schema_version":"1.0","event_id":"sha256:c87f1830a119c20da60254ab050db24d7e0874606e7a9738c2eb63c199167a8a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:HJHTPACV2FRJZLZLPTHSVSDASC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fair representation by independent sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dani Kotlar, Eli Berger, Maria Chudnovsky, Martin Loebl, Noga Alon, Ran Ziv, Ron Aharoni","submitted_at":"2016-11-10T06:31:33Z","abstract_excerpt":"For a hypergraph $H$ let $\\beta(H)$ denote the minimal number of edges from $H$ covering $V(H)$. An edge $S$ of $H$ is said to represent {\\em fairly} (resp. {\\em almost fairly}) a partition $(V_1,V_2, \\ldots, V_m)$ of $V(H)$ if $|S\\cap V_i|\\ge \\lfloor\\frac{|V_i|}{\\beta(H)}\\rfloor$ (resp. $|S\\cap V_i|\\ge \\lfloor\\frac{|V_i|}{\\beta(H)}\\rfloor-1$) for all $i \\le m$.\n  In matroids any partition of $V(H)$ can be represented fairly by some independent set. We look for classes of hypergraphs $H$ in which any partition of $V(H)$ can be represented almost fairly by some edge.\n  We show that this is true"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.03196","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-18T00:59:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wiDhitUlNSHsf3SVRPAJ0P0Lnzjr0qHH4qGu8RM7wxXy+5SbX22SFGvJ44lmHSiFo2yIa2LhvraZU5fRPRR2DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T12:06:20.894257Z"},"content_sha256":"013dc4c9ddf4830d6f330c5fc0c4c0bbe05b54cc6e3e490eb409b8f1755429d4","schema_version":"1.0","event_id":"sha256:013dc4c9ddf4830d6f330c5fc0c4c0bbe05b54cc6e3e490eb409b8f1755429d4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HJHTPACV2FRJZLZLPTHSVSDASC/bundle.json","state_url":"https://pith.science/pith/HJHTPACV2FRJZLZLPTHSVSDASC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HJHTPACV2FRJZLZLPTHSVSDASC/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-05-23T12:06:20Z","links":{"resolver":"https://pith.science/pith/HJHTPACV2FRJZLZLPTHSVSDASC","bundle":"https://pith.science/pith/HJHTPACV2FRJZLZLPTHSVSDASC/bundle.json","state":"https://pith.science/pith/HJHTPACV2FRJZLZLPTHSVSDASC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HJHTPACV2FRJZLZLPTHSVSDASC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:HJHTPACV2FRJZLZLPTHSVSDASC","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":"e093826d0ac750c8a9ce983e9243208ffd096991eb7bea17e8ab5cc096cb4690","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-10T06:31:33Z","title_canon_sha256":"6c35f3f6561febb8b16a716cd63c5ea638ed95d5f64af021eaf5dea130f17a53"},"schema_version":"1.0","source":{"id":"1611.03196","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.03196","created_at":"2026-05-18T00:59:41Z"},{"alias_kind":"arxiv_version","alias_value":"1611.03196v1","created_at":"2026-05-18T00:59:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.03196","created_at":"2026-05-18T00:59:41Z"},{"alias_kind":"pith_short_12","alias_value":"HJHTPACV2FRJ","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"HJHTPACV2FRJZLZL","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"HJHTPACV","created_at":"2026-05-18T12:30:19Z"}],"graph_snapshots":[{"event_id":"sha256:013dc4c9ddf4830d6f330c5fc0c4c0bbe05b54cc6e3e490eb409b8f1755429d4","target":"graph","created_at":"2026-05-18T00:59:41Z","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":"For a hypergraph $H$ let $\\beta(H)$ denote the minimal number of edges from $H$ covering $V(H)$. An edge $S$ of $H$ is said to represent {\\em fairly} (resp. {\\em almost fairly}) a partition $(V_1,V_2, \\ldots, V_m)$ of $V(H)$ if $|S\\cap V_i|\\ge \\lfloor\\frac{|V_i|}{\\beta(H)}\\rfloor$ (resp. $|S\\cap V_i|\\ge \\lfloor\\frac{|V_i|}{\\beta(H)}\\rfloor-1$) for all $i \\le m$.\n  In matroids any partition of $V(H)$ can be represented fairly by some independent set. We look for classes of hypergraphs $H$ in which any partition of $V(H)$ can be represented almost fairly by some edge.\n  We show that this is true","authors_text":"Dani Kotlar, Eli Berger, Maria Chudnovsky, Martin Loebl, Noga Alon, Ran Ziv, Ron Aharoni","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-10T06:31:33Z","title":"Fair representation by independent sets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.03196","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:c87f1830a119c20da60254ab050db24d7e0874606e7a9738c2eb63c199167a8a","target":"record","created_at":"2026-05-18T00:59:41Z","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":"e093826d0ac750c8a9ce983e9243208ffd096991eb7bea17e8ab5cc096cb4690","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-10T06:31:33Z","title_canon_sha256":"6c35f3f6561febb8b16a716cd63c5ea638ed95d5f64af021eaf5dea130f17a53"},"schema_version":"1.0","source":{"id":"1611.03196","kind":"arxiv","version":1}},"canonical_sha256":"3a4f378055d1629caf2b7ccf2ac860909e585ab7989fe98764c8b16f7d166a6d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3a4f378055d1629caf2b7ccf2ac860909e585ab7989fe98764c8b16f7d166a6d","first_computed_at":"2026-05-18T00:59:41.053670Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:59:41.053670Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"o3bwyd37p8AobPYvIMByCAJvwsEE5KGlGaxLjjaIUz1BxH8aBFTqZC4nMqLJG/k7ym/36+yAgmKJB/H05DMPCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:59:41.054407Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.03196","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c87f1830a119c20da60254ab050db24d7e0874606e7a9738c2eb63c199167a8a","sha256:013dc4c9ddf4830d6f330c5fc0c4c0bbe05b54cc6e3e490eb409b8f1755429d4"],"state_sha256":"df881be573a33be58e8f3d77df0fb3e8ebbd20673a14fd472160039c502da55b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5jjwA/L2d7mA8Nbd4lIvXFUgOmyOj/lk468LB6EYEV0a2rkok3qYm80ij7ABYmlCM7/nS2wO1aZPoKJLNELwAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T12:06:20.897546Z","bundle_sha256":"136bbf18dbff023cb50459316ed053096853455194261261cfcc7cd17efd7bce"}}