{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:CKYPI7TMSYVBE3FJWHYOMG4OEW","short_pith_number":"pith:CKYPI7TM","canonical_record":{"source":{"id":"1111.0234","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-11-01T16:13:31Z","cross_cats_sorted":[],"title_canon_sha256":"5e9476f28dc9893eef2ba1a4fa1d7330b2ed4f7a2b67e282e29d95416a22885a","abstract_canon_sha256":"7ddf04a4e5d0e06ed876efd43c214481123f948827f7682cb6485558e4ebb688"},"schema_version":"1.0"},"canonical_sha256":"12b0f47e6c962a126ca9b1f0e61b8e2588946bc89d550aec23b16c301563110e","source":{"kind":"arxiv","id":"1111.0234","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.0234","created_at":"2026-05-18T04:09:46Z"},{"alias_kind":"arxiv_version","alias_value":"1111.0234v1","created_at":"2026-05-18T04:09:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.0234","created_at":"2026-05-18T04:09:46Z"},{"alias_kind":"pith_short_12","alias_value":"CKYPI7TMSYVB","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"CKYPI7TMSYVBE3FJ","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"CKYPI7TM","created_at":"2026-05-18T12:26:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:CKYPI7TMSYVBE3FJWHYOMG4OEW","target":"record","payload":{"canonical_record":{"source":{"id":"1111.0234","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-11-01T16:13:31Z","cross_cats_sorted":[],"title_canon_sha256":"5e9476f28dc9893eef2ba1a4fa1d7330b2ed4f7a2b67e282e29d95416a22885a","abstract_canon_sha256":"7ddf04a4e5d0e06ed876efd43c214481123f948827f7682cb6485558e4ebb688"},"schema_version":"1.0"},"canonical_sha256":"12b0f47e6c962a126ca9b1f0e61b8e2588946bc89d550aec23b16c301563110e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:09:46.142214Z","signature_b64":"gVRoJrhA9+fAcXaoa4mKt/cOMwEKdsReCrWFfY9VrRVLXlAIuaHyQ+rWV1a38D6XZhtpeQYxUHqbgMD74CshAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"12b0f47e6c962a126ca9b1f0e61b8e2588946bc89d550aec23b16c301563110e","last_reissued_at":"2026-05-18T04:09:46.141621Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:09:46.141621Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1111.0234","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-18T04:09:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UCpm7gDwCE6t+MDoze0j5adv1N5yJbocdK3yhyzKlJAQVaRpOg5C7VFkvWEJNj4SemCS0k1D35v1/mKjMpDPBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T22:13:12.209578Z"},"content_sha256":"213d0546be8b8add64c5163edf75adc0fc883f3986062eb48ee89cfb57b10f5d","schema_version":"1.0","event_id":"sha256:213d0546be8b8add64c5163edf75adc0fc883f3986062eb48ee89cfb57b10f5d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:CKYPI7TMSYVBE3FJWHYOMG4OEW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"List colorings with distinct list sizes, the case of complete bipartite graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ida Kantor, Zolt\\'an F\\\"uredi","submitted_at":"2011-11-01T16:13:31Z","abstract_excerpt":"Let $f:V \\rightarrow \\mathbb{N}$ be a function on the vertex set of the graph $G=(V,E)$. The graph $G$ is {\\em $f$-choosable} if for every collection of lists with list sizes specified by $f$ there is a proper coloring using colors from the lists. The sum choice number, $\\chi_{sc}(G)$, is the minimum of $\\sum f(v)$, over all functions $f$ such that $G$ is $f$-choosable. It is known (Alon 1993, 2000) that if $G$ has average degree $d$, then the usual choice number $\\chi_\\ell(G)$ is at least $\\Omega(\\log d)$, so they grow simultaneously.\n  In this paper we show that $\\chi_{sc}(G)/|V(G)|$ can be "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.0234","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-18T04:09:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GAgSG8hWQiAWqkuB4a18IbzxOilnx0GVLvmm2FInid+0/C3FZb39KgTM1XIi3Y0HFnT7dFz1eMqNvqaHOkDzAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T22:13:12.210234Z"},"content_sha256":"9b9b2dc9f9cef4d1f573658125fa34b0ba4edd6d3f9d38f635dd05f9bf9ba7fb","schema_version":"1.0","event_id":"sha256:9b9b2dc9f9cef4d1f573658125fa34b0ba4edd6d3f9d38f635dd05f9bf9ba7fb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CKYPI7TMSYVBE3FJWHYOMG4OEW/bundle.json","state_url":"https://pith.science/pith/CKYPI7TMSYVBE3FJWHYOMG4OEW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CKYPI7TMSYVBE3FJWHYOMG4OEW/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-31T22:13:12Z","links":{"resolver":"https://pith.science/pith/CKYPI7TMSYVBE3FJWHYOMG4OEW","bundle":"https://pith.science/pith/CKYPI7TMSYVBE3FJWHYOMG4OEW/bundle.json","state":"https://pith.science/pith/CKYPI7TMSYVBE3FJWHYOMG4OEW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CKYPI7TMSYVBE3FJWHYOMG4OEW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:CKYPI7TMSYVBE3FJWHYOMG4OEW","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":"7ddf04a4e5d0e06ed876efd43c214481123f948827f7682cb6485558e4ebb688","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-11-01T16:13:31Z","title_canon_sha256":"5e9476f28dc9893eef2ba1a4fa1d7330b2ed4f7a2b67e282e29d95416a22885a"},"schema_version":"1.0","source":{"id":"1111.0234","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.0234","created_at":"2026-05-18T04:09:46Z"},{"alias_kind":"arxiv_version","alias_value":"1111.0234v1","created_at":"2026-05-18T04:09:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.0234","created_at":"2026-05-18T04:09:46Z"},{"alias_kind":"pith_short_12","alias_value":"CKYPI7TMSYVB","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"CKYPI7TMSYVBE3FJ","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"CKYPI7TM","created_at":"2026-05-18T12:26:26Z"}],"graph_snapshots":[{"event_id":"sha256:9b9b2dc9f9cef4d1f573658125fa34b0ba4edd6d3f9d38f635dd05f9bf9ba7fb","target":"graph","created_at":"2026-05-18T04:09:46Z","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":"Let $f:V \\rightarrow \\mathbb{N}$ be a function on the vertex set of the graph $G=(V,E)$. The graph $G$ is {\\em $f$-choosable} if for every collection of lists with list sizes specified by $f$ there is a proper coloring using colors from the lists. The sum choice number, $\\chi_{sc}(G)$, is the minimum of $\\sum f(v)$, over all functions $f$ such that $G$ is $f$-choosable. It is known (Alon 1993, 2000) that if $G$ has average degree $d$, then the usual choice number $\\chi_\\ell(G)$ is at least $\\Omega(\\log d)$, so they grow simultaneously.\n  In this paper we show that $\\chi_{sc}(G)/|V(G)|$ can be ","authors_text":"Ida Kantor, Zolt\\'an F\\\"uredi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-11-01T16:13:31Z","title":"List colorings with distinct list sizes, the case of complete bipartite graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.0234","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:213d0546be8b8add64c5163edf75adc0fc883f3986062eb48ee89cfb57b10f5d","target":"record","created_at":"2026-05-18T04:09:46Z","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":"7ddf04a4e5d0e06ed876efd43c214481123f948827f7682cb6485558e4ebb688","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-11-01T16:13:31Z","title_canon_sha256":"5e9476f28dc9893eef2ba1a4fa1d7330b2ed4f7a2b67e282e29d95416a22885a"},"schema_version":"1.0","source":{"id":"1111.0234","kind":"arxiv","version":1}},"canonical_sha256":"12b0f47e6c962a126ca9b1f0e61b8e2588946bc89d550aec23b16c301563110e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"12b0f47e6c962a126ca9b1f0e61b8e2588946bc89d550aec23b16c301563110e","first_computed_at":"2026-05-18T04:09:46.141621Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:09:46.141621Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gVRoJrhA9+fAcXaoa4mKt/cOMwEKdsReCrWFfY9VrRVLXlAIuaHyQ+rWV1a38D6XZhtpeQYxUHqbgMD74CshAw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:09:46.142214Z","signed_message":"canonical_sha256_bytes"},"source_id":"1111.0234","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:213d0546be8b8add64c5163edf75adc0fc883f3986062eb48ee89cfb57b10f5d","sha256:9b9b2dc9f9cef4d1f573658125fa34b0ba4edd6d3f9d38f635dd05f9bf9ba7fb"],"state_sha256":"bbfe102de6a96ddb7bb636675c4635dd51f52af1ee7ad15815c61ce883a2c8b4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tS1ewO/QvR9TEqYl1rRiQv0xDuj5V6fkwIiC1tKFm2TAbUD+I3/+BK0+/n6f3BP5MBMzDJNhxU7OQxBGad4SBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T22:13:12.214498Z","bundle_sha256":"7e42708949c0220499a514627896233ed23383337081e0fae42b9752e8d719ec"}}