{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:GGKJC5VPHEGAHPE624ANWEZUFC","short_pith_number":"pith:GGKJC5VP","canonical_record":{"source":{"id":"2502.10516","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2025-02-14T19:24:55Z","cross_cats_sorted":[],"title_canon_sha256":"6daa520b09642e912d8cf0307f6bd6db1f1dc73a54da71caf781761df2ac4540","abstract_canon_sha256":"59ed27a760d9a8a6776f0bf22cd9f9b174027c278106005bd50c9c663345bc79"},"schema_version":"1.0"},"canonical_sha256":"31949176af390c03bc9ed700db1334288b36cc1ae7b95b04f620b99df3894f87","source":{"kind":"arxiv","id":"2502.10516","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.10516","created_at":"2026-07-05T10:16:21Z"},{"alias_kind":"arxiv_version","alias_value":"2502.10516v2","created_at":"2026-07-05T10:16:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.10516","created_at":"2026-07-05T10:16:21Z"},{"alias_kind":"pith_short_12","alias_value":"GGKJC5VPHEGA","created_at":"2026-07-05T10:16:21Z"},{"alias_kind":"pith_short_16","alias_value":"GGKJC5VPHEGAHPE6","created_at":"2026-07-05T10:16:21Z"},{"alias_kind":"pith_short_8","alias_value":"GGKJC5VP","created_at":"2026-07-05T10:16:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:GGKJC5VPHEGAHPE624ANWEZUFC","target":"record","payload":{"canonical_record":{"source":{"id":"2502.10516","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2025-02-14T19:24:55Z","cross_cats_sorted":[],"title_canon_sha256":"6daa520b09642e912d8cf0307f6bd6db1f1dc73a54da71caf781761df2ac4540","abstract_canon_sha256":"59ed27a760d9a8a6776f0bf22cd9f9b174027c278106005bd50c9c663345bc79"},"schema_version":"1.0"},"canonical_sha256":"31949176af390c03bc9ed700db1334288b36cc1ae7b95b04f620b99df3894f87","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:16:21.209181Z","signature_b64":"vBUzK5UnBFM4Kxk/bGWpfM78G8deOrTzXdy3abxaISyodgXF/rpAYAfcKiGrAUiwO3E/I1RCw12ueBxZwgu2CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"31949176af390c03bc9ed700db1334288b36cc1ae7b95b04f620b99df3894f87","last_reissued_at":"2026-07-05T10:16:21.208695Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:16:21.208695Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2502.10516","source_version":2,"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-07-05T10:16:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ir7r+VBsK586o7EK7mRXiProenK8B5hz3U1ZfBVWicvAZBrYaIO+OSPdeZ/N5tZTV/uI9vROQaI01Hza8/MYDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T03:51:52.709431Z"},"content_sha256":"f507302296bbe707c4b9fa35e9d08fab2f1aceb2df20c6b93449294c922f2779","schema_version":"1.0","event_id":"sha256:f507302296bbe707c4b9fa35e9d08fab2f1aceb2df20c6b93449294c922f2779"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:GGKJC5VPHEGAHPE624ANWEZUFC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A new lower bound for multi-color discrepancy with applications to fair division","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Ioannis Caragiannis, Kasper Green Larsen, Sudarshan Shyam","submitted_at":"2025-02-14T19:24:55Z","abstract_excerpt":"A classical problem in combinatorics seeks colorings of low discrepancy. More concretely, the goal is to color the elements of a set system so that the number of appearances of any color among the elements in each set is as balanced as possible. We present a new lower bound for multi-color discrepancy, showing that there is a set system with $n$ subsets over a set of elements in which any $k$-coloring of the elements has discrepancy at least $\\Omega\\left(\\sqrt{\\frac{n}{\\ln{k}}}\\right)$. This result improves the previously best-known lower bound of $\\Omega\\left(\\sqrt{\\frac{n}{k}}\\right)$ of Doe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.10516","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2502.10516/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T10:16:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fBM2rkxowEcZ7jTvMNKpPr1+81X+juezJ1j0KbqqDnHAeOPG4UHvplvAHv+ETThh0ZFaPMAE8jW2ibOixpxCAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T03:51:52.709805Z"},"content_sha256":"b9da68086b6c0bfbecf6b50c504e3e3249a25830298557bdf22d45cf4900f79d","schema_version":"1.0","event_id":"sha256:b9da68086b6c0bfbecf6b50c504e3e3249a25830298557bdf22d45cf4900f79d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GGKJC5VPHEGAHPE624ANWEZUFC/bundle.json","state_url":"https://pith.science/pith/GGKJC5VPHEGAHPE624ANWEZUFC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GGKJC5VPHEGAHPE624ANWEZUFC/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-07-07T03:51:52Z","links":{"resolver":"https://pith.science/pith/GGKJC5VPHEGAHPE624ANWEZUFC","bundle":"https://pith.science/pith/GGKJC5VPHEGAHPE624ANWEZUFC/bundle.json","state":"https://pith.science/pith/GGKJC5VPHEGAHPE624ANWEZUFC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GGKJC5VPHEGAHPE624ANWEZUFC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:GGKJC5VPHEGAHPE624ANWEZUFC","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":"59ed27a760d9a8a6776f0bf22cd9f9b174027c278106005bd50c9c663345bc79","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2025-02-14T19:24:55Z","title_canon_sha256":"6daa520b09642e912d8cf0307f6bd6db1f1dc73a54da71caf781761df2ac4540"},"schema_version":"1.0","source":{"id":"2502.10516","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.10516","created_at":"2026-07-05T10:16:21Z"},{"alias_kind":"arxiv_version","alias_value":"2502.10516v2","created_at":"2026-07-05T10:16:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.10516","created_at":"2026-07-05T10:16:21Z"},{"alias_kind":"pith_short_12","alias_value":"GGKJC5VPHEGA","created_at":"2026-07-05T10:16:21Z"},{"alias_kind":"pith_short_16","alias_value":"GGKJC5VPHEGAHPE6","created_at":"2026-07-05T10:16:21Z"},{"alias_kind":"pith_short_8","alias_value":"GGKJC5VP","created_at":"2026-07-05T10:16:21Z"}],"graph_snapshots":[{"event_id":"sha256:b9da68086b6c0bfbecf6b50c504e3e3249a25830298557bdf22d45cf4900f79d","target":"graph","created_at":"2026-07-05T10:16:21Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2502.10516/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A classical problem in combinatorics seeks colorings of low discrepancy. More concretely, the goal is to color the elements of a set system so that the number of appearances of any color among the elements in each set is as balanced as possible. We present a new lower bound for multi-color discrepancy, showing that there is a set system with $n$ subsets over a set of elements in which any $k$-coloring of the elements has discrepancy at least $\\Omega\\left(\\sqrt{\\frac{n}{\\ln{k}}}\\right)$. This result improves the previously best-known lower bound of $\\Omega\\left(\\sqrt{\\frac{n}{k}}\\right)$ of Doe","authors_text":"Ioannis Caragiannis, Kasper Green Larsen, Sudarshan Shyam","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2025-02-14T19:24:55Z","title":"A new lower bound for multi-color discrepancy with applications to fair division"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.10516","kind":"arxiv","version":2},"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:f507302296bbe707c4b9fa35e9d08fab2f1aceb2df20c6b93449294c922f2779","target":"record","created_at":"2026-07-05T10:16:21Z","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":"59ed27a760d9a8a6776f0bf22cd9f9b174027c278106005bd50c9c663345bc79","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2025-02-14T19:24:55Z","title_canon_sha256":"6daa520b09642e912d8cf0307f6bd6db1f1dc73a54da71caf781761df2ac4540"},"schema_version":"1.0","source":{"id":"2502.10516","kind":"arxiv","version":2}},"canonical_sha256":"31949176af390c03bc9ed700db1334288b36cc1ae7b95b04f620b99df3894f87","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"31949176af390c03bc9ed700db1334288b36cc1ae7b95b04f620b99df3894f87","first_computed_at":"2026-07-05T10:16:21.208695Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:16:21.208695Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vBUzK5UnBFM4Kxk/bGWpfM78G8deOrTzXdy3abxaISyodgXF/rpAYAfcKiGrAUiwO3E/I1RCw12ueBxZwgu2CA==","signature_status":"signed_v1","signed_at":"2026-07-05T10:16:21.209181Z","signed_message":"canonical_sha256_bytes"},"source_id":"2502.10516","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f507302296bbe707c4b9fa35e9d08fab2f1aceb2df20c6b93449294c922f2779","sha256:b9da68086b6c0bfbecf6b50c504e3e3249a25830298557bdf22d45cf4900f79d"],"state_sha256":"23d34492a92e347c79913228b68c9f81cc3393be3640ff26afd1d9d7f26b63e2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M4XumioLmmmZTTYY7vR4veV5z+po3u9mAnuibZiOt97besro2M4CmmuH1BDYjnJX9qbvN4piyKo0hTRNxJGPDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T03:51:52.712007Z","bundle_sha256":"9a2eb7ad01428cf3e6f041824b46b8423cd77a26af3e2927a3ac65822734322d"}}