{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:7Q6SQKXBI65YRVPH57B3XYMNOO","short_pith_number":"pith:7Q6SQKXB","canonical_record":{"source":{"id":"1701.05532","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-19T18:01:10Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"8ecdb0eb55993c152456f4792b72126a8204ad3d8104516a5cd10ad098d459b3","abstract_canon_sha256":"7cce5fdce9d7ce923029ce1eeeb9f94aedafdff9450f99c8d85c2b84374c2159"},"schema_version":"1.0"},"canonical_sha256":"fc3d282ae147bb88d5e7efc3bbe18d738a7d5ee744fcd83c864fc5aeab1c85b3","source":{"kind":"arxiv","id":"1701.05532","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.05532","created_at":"2026-05-18T00:46:18Z"},{"alias_kind":"arxiv_version","alias_value":"1701.05532v2","created_at":"2026-05-18T00:46:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.05532","created_at":"2026-05-18T00:46:18Z"},{"alias_kind":"pith_short_12","alias_value":"7Q6SQKXBI65Y","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"7Q6SQKXBI65YRVPH","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"7Q6SQKXB","created_at":"2026-05-18T12:31:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:7Q6SQKXBI65YRVPH57B3XYMNOO","target":"record","payload":{"canonical_record":{"source":{"id":"1701.05532","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-19T18:01:10Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"8ecdb0eb55993c152456f4792b72126a8204ad3d8104516a5cd10ad098d459b3","abstract_canon_sha256":"7cce5fdce9d7ce923029ce1eeeb9f94aedafdff9450f99c8d85c2b84374c2159"},"schema_version":"1.0"},"canonical_sha256":"fc3d282ae147bb88d5e7efc3bbe18d738a7d5ee744fcd83c864fc5aeab1c85b3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:18.567744Z","signature_b64":"Qvph0BjK0Xi3C8sAIqpJF9JWHJeTGDAwpFc6L2oav8ICGmL84sVM42Eaypb4af6o7o+A+dNc+x6HQnnMYGE3Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fc3d282ae147bb88d5e7efc3bbe18d738a7d5ee744fcd83c864fc5aeab1c85b3","last_reissued_at":"2026-05-18T00:46:18.567358Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:18.567358Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.05532","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-05-18T00:46:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o4vvZKcv61yqS/E4X5OGIoG+Xqwzb+FB/8VJqOIGr+sWclz+/pIFlyOMVOvE/aqnxxTnJ4T//VchUhzKE0jtCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T00:57:45.127947Z"},"content_sha256":"cb74ee8ae7f3c36e0a87913f19a9a1da88f6bd6ebe75ae7afe654d52a66e2a89","schema_version":"1.0","event_id":"sha256:cb74ee8ae7f3c36e0a87913f19a9a1da88f6bd6ebe75ae7afe654d52a66e2a89"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:7Q6SQKXBI65YRVPH57B3XYMNOO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tighter Bounds for the Discrepancy of Boxes and Polytopes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"math.CO","authors_text":"Aleksandar Nikolov","submitted_at":"2017-01-19T18:01:10Z","abstract_excerpt":"Combinatorial discrepancy is a complexity measure of a collection of sets which quantifies how well the sets in the collection can be simultaneously balanced. More precisely, we are given an n-point set $P$, and a collection $\\mathcal{F} = \\{F_1, ..., F_m\\}$ of subsets of $P$, and our goal is color $P$ with two colors, red and blue, so that the maximum over the $F_i$ of the absolute difference between the number of red elements and the number of blue elements (the discrepancy) is minimized. Combinatorial discrepancy has many applications in mathematics and computer science, including construct"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.05532","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":""},"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:46:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MvNnTm6PYm9QdECZ9My9jKrue8UQR/178TLPaDRb/wDd7ueGs1JRBaLhupXhdN5HV+jjMPiOoizjvXjm3UViAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T00:57:45.128293Z"},"content_sha256":"81993ba45ac7aa93a991f97740f1558661b726053df7d9be823af2ed29584a16","schema_version":"1.0","event_id":"sha256:81993ba45ac7aa93a991f97740f1558661b726053df7d9be823af2ed29584a16"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7Q6SQKXBI65YRVPH57B3XYMNOO/bundle.json","state_url":"https://pith.science/pith/7Q6SQKXBI65YRVPH57B3XYMNOO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7Q6SQKXBI65YRVPH57B3XYMNOO/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-31T00:57:45Z","links":{"resolver":"https://pith.science/pith/7Q6SQKXBI65YRVPH57B3XYMNOO","bundle":"https://pith.science/pith/7Q6SQKXBI65YRVPH57B3XYMNOO/bundle.json","state":"https://pith.science/pith/7Q6SQKXBI65YRVPH57B3XYMNOO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7Q6SQKXBI65YRVPH57B3XYMNOO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:7Q6SQKXBI65YRVPH57B3XYMNOO","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":"7cce5fdce9d7ce923029ce1eeeb9f94aedafdff9450f99c8d85c2b84374c2159","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-19T18:01:10Z","title_canon_sha256":"8ecdb0eb55993c152456f4792b72126a8204ad3d8104516a5cd10ad098d459b3"},"schema_version":"1.0","source":{"id":"1701.05532","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.05532","created_at":"2026-05-18T00:46:18Z"},{"alias_kind":"arxiv_version","alias_value":"1701.05532v2","created_at":"2026-05-18T00:46:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.05532","created_at":"2026-05-18T00:46:18Z"},{"alias_kind":"pith_short_12","alias_value":"7Q6SQKXBI65Y","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"7Q6SQKXBI65YRVPH","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"7Q6SQKXB","created_at":"2026-05-18T12:31:05Z"}],"graph_snapshots":[{"event_id":"sha256:81993ba45ac7aa93a991f97740f1558661b726053df7d9be823af2ed29584a16","target":"graph","created_at":"2026-05-18T00:46:18Z","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":"Combinatorial discrepancy is a complexity measure of a collection of sets which quantifies how well the sets in the collection can be simultaneously balanced. More precisely, we are given an n-point set $P$, and a collection $\\mathcal{F} = \\{F_1, ..., F_m\\}$ of subsets of $P$, and our goal is color $P$ with two colors, red and blue, so that the maximum over the $F_i$ of the absolute difference between the number of red elements and the number of blue elements (the discrepancy) is minimized. Combinatorial discrepancy has many applications in mathematics and computer science, including construct","authors_text":"Aleksandar Nikolov","cross_cats":["cs.CG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-19T18:01:10Z","title":"Tighter Bounds for the Discrepancy of Boxes and Polytopes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.05532","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:cb74ee8ae7f3c36e0a87913f19a9a1da88f6bd6ebe75ae7afe654d52a66e2a89","target":"record","created_at":"2026-05-18T00:46:18Z","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":"7cce5fdce9d7ce923029ce1eeeb9f94aedafdff9450f99c8d85c2b84374c2159","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-19T18:01:10Z","title_canon_sha256":"8ecdb0eb55993c152456f4792b72126a8204ad3d8104516a5cd10ad098d459b3"},"schema_version":"1.0","source":{"id":"1701.05532","kind":"arxiv","version":2}},"canonical_sha256":"fc3d282ae147bb88d5e7efc3bbe18d738a7d5ee744fcd83c864fc5aeab1c85b3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fc3d282ae147bb88d5e7efc3bbe18d738a7d5ee744fcd83c864fc5aeab1c85b3","first_computed_at":"2026-05-18T00:46:18.567358Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:46:18.567358Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Qvph0BjK0Xi3C8sAIqpJF9JWHJeTGDAwpFc6L2oav8ICGmL84sVM42Eaypb4af6o7o+A+dNc+x6HQnnMYGE3Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:46:18.567744Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.05532","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cb74ee8ae7f3c36e0a87913f19a9a1da88f6bd6ebe75ae7afe654d52a66e2a89","sha256:81993ba45ac7aa93a991f97740f1558661b726053df7d9be823af2ed29584a16"],"state_sha256":"3b20e3e130cb0b494c03fb1e63445799480a678c161606c27030f86e611b9ebb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s4ZidGcFvt1V7AzPcnOFaeVZNmRxeDYzoQ65ZCayLBRHadwmgv4Ut3Zb4tc40FR3wTGdyxvSB+QV/k9xyfB+Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T00:57:45.130214Z","bundle_sha256":"2d818c2073a9440a184f571f10e5b7abf774ef3dd40b85710707d30cfe899e7e"}}