{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:DV7ORHV6BJH2YRFBLWX7AMG7OA","short_pith_number":"pith:DV7ORHV6","canonical_record":{"source":{"id":"2506.23264","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-06-29T14:38:04Z","cross_cats_sorted":[],"title_canon_sha256":"4a09ad0a971a1316548bb2f5ea7c1f1b0a0683f9cb489b4dea53050dcd3cdc68","abstract_canon_sha256":"b4f53714d79f397e8bc9100a090471f07da88f8170893d7b1a2d646c4e6c9a69"},"schema_version":"1.0"},"canonical_sha256":"1d7ee89ebe0a4fac44a15daff030df700c7a04629ba823cae175f68d7764f557","source":{"kind":"arxiv","id":"2506.23264","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.23264","created_at":"2026-07-05T11:29:18Z"},{"alias_kind":"arxiv_version","alias_value":"2506.23264v1","created_at":"2026-07-05T11:29:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.23264","created_at":"2026-07-05T11:29:18Z"},{"alias_kind":"pith_short_12","alias_value":"DV7ORHV6BJH2","created_at":"2026-07-05T11:29:18Z"},{"alias_kind":"pith_short_16","alias_value":"DV7ORHV6BJH2YRFB","created_at":"2026-07-05T11:29:18Z"},{"alias_kind":"pith_short_8","alias_value":"DV7ORHV6","created_at":"2026-07-05T11:29:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:DV7ORHV6BJH2YRFBLWX7AMG7OA","target":"record","payload":{"canonical_record":{"source":{"id":"2506.23264","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-06-29T14:38:04Z","cross_cats_sorted":[],"title_canon_sha256":"4a09ad0a971a1316548bb2f5ea7c1f1b0a0683f9cb489b4dea53050dcd3cdc68","abstract_canon_sha256":"b4f53714d79f397e8bc9100a090471f07da88f8170893d7b1a2d646c4e6c9a69"},"schema_version":"1.0"},"canonical_sha256":"1d7ee89ebe0a4fac44a15daff030df700c7a04629ba823cae175f68d7764f557","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:29:18.823282Z","signature_b64":"lSJe5USZLkQGd5Sjur0VaNHNseddIzVyaqyRXPcB3HR/AdrdD8kkYEmbOLMEca6xMWEmPH+1Q0hu3y3cRnFYBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1d7ee89ebe0a4fac44a15daff030df700c7a04629ba823cae175f68d7764f557","last_reissued_at":"2026-07-05T11:29:18.822708Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:29:18.822708Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2506.23264","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-07-05T11:29:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u3C/qg5FzsqqwWPkncmiixRVyIs4pTdZ1WuT7mK/Q5hEkfOxJlt+bwceMBIyGPSVw6jEq/lTQvZ6sSol1ImyDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T11:10:38.163088Z"},"content_sha256":"3e2f372809194fa8c24e487db8b98fcdcb37ca94f4ee22cb49938fa47f407d8c","schema_version":"1.0","event_id":"sha256:3e2f372809194fa8c24e487db8b98fcdcb37ca94f4ee22cb49938fa47f407d8c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:DV7ORHV6BJH2YRFBLWX7AMG7OA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Relative discrepancy of hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Diep Luong-Le, Dilong Yang, Tuan Tran","submitted_at":"2025-06-29T14:38:04Z","abstract_excerpt":"Given $k$-uniform hypergraphs $G$ and $H$ on $n$ vertices with densities $p$ and $q$, their relative discrepancy is defined as $\\hbox{disc}(G,H)=\\max\\big||E(G')\\cap E(H')|-pq\\binom{n}{k}\\big|$, where the maximum ranges over all pairs $G',H'$ with $G'\\cong G$, $H'\\cong H$, and $V(G')=V(H')$. Let $\\hbox{bs}(k)$ denote the smallest integer $m \\ge 2$ such that any collection of $m$ $k$-uniform hypergraphs on $n$ vertices with moderate densities contains a pair $G,H$ for which $\\hbox{disc}(G,H) = \\Omega(n^{(k+1)/2})$.\n  In this paper, we answer several questions raised by Bollob\\'as and Scott, prov"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.23264","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2506.23264/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-05T11:29:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fCPY6z5c+M0bXQC9w+mpcP2IGcAeZvv5K7oXkHVSYDXwgOYN0RTaU9s1QhA1VccWRB0JB51yG4nPX4ReuLfVAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T11:10:38.163774Z"},"content_sha256":"7831eda9cc2fd5efffde26e8c3ac1f909d7c5a8ac17a076ee7c138e6c457ce8d","schema_version":"1.0","event_id":"sha256:7831eda9cc2fd5efffde26e8c3ac1f909d7c5a8ac17a076ee7c138e6c457ce8d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DV7ORHV6BJH2YRFBLWX7AMG7OA/bundle.json","state_url":"https://pith.science/pith/DV7ORHV6BJH2YRFBLWX7AMG7OA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DV7ORHV6BJH2YRFBLWX7AMG7OA/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-08-08T11:10:38Z","links":{"resolver":"https://pith.science/pith/DV7ORHV6BJH2YRFBLWX7AMG7OA","bundle":"https://pith.science/pith/DV7ORHV6BJH2YRFBLWX7AMG7OA/bundle.json","state":"https://pith.science/pith/DV7ORHV6BJH2YRFBLWX7AMG7OA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DV7ORHV6BJH2YRFBLWX7AMG7OA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:DV7ORHV6BJH2YRFBLWX7AMG7OA","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":"b4f53714d79f397e8bc9100a090471f07da88f8170893d7b1a2d646c4e6c9a69","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-06-29T14:38:04Z","title_canon_sha256":"4a09ad0a971a1316548bb2f5ea7c1f1b0a0683f9cb489b4dea53050dcd3cdc68"},"schema_version":"1.0","source":{"id":"2506.23264","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.23264","created_at":"2026-07-05T11:29:18Z"},{"alias_kind":"arxiv_version","alias_value":"2506.23264v1","created_at":"2026-07-05T11:29:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.23264","created_at":"2026-07-05T11:29:18Z"},{"alias_kind":"pith_short_12","alias_value":"DV7ORHV6BJH2","created_at":"2026-07-05T11:29:18Z"},{"alias_kind":"pith_short_16","alias_value":"DV7ORHV6BJH2YRFB","created_at":"2026-07-05T11:29:18Z"},{"alias_kind":"pith_short_8","alias_value":"DV7ORHV6","created_at":"2026-07-05T11:29:18Z"}],"graph_snapshots":[{"event_id":"sha256:7831eda9cc2fd5efffde26e8c3ac1f909d7c5a8ac17a076ee7c138e6c457ce8d","target":"graph","created_at":"2026-07-05T11:29: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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2506.23264/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Given $k$-uniform hypergraphs $G$ and $H$ on $n$ vertices with densities $p$ and $q$, their relative discrepancy is defined as $\\hbox{disc}(G,H)=\\max\\big||E(G')\\cap E(H')|-pq\\binom{n}{k}\\big|$, where the maximum ranges over all pairs $G',H'$ with $G'\\cong G$, $H'\\cong H$, and $V(G')=V(H')$. Let $\\hbox{bs}(k)$ denote the smallest integer $m \\ge 2$ such that any collection of $m$ $k$-uniform hypergraphs on $n$ vertices with moderate densities contains a pair $G,H$ for which $\\hbox{disc}(G,H) = \\Omega(n^{(k+1)/2})$.\n  In this paper, we answer several questions raised by Bollob\\'as and Scott, prov","authors_text":"Diep Luong-Le, Dilong Yang, Tuan Tran","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-06-29T14:38:04Z","title":"Relative discrepancy of hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.23264","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:3e2f372809194fa8c24e487db8b98fcdcb37ca94f4ee22cb49938fa47f407d8c","target":"record","created_at":"2026-07-05T11:29: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":"b4f53714d79f397e8bc9100a090471f07da88f8170893d7b1a2d646c4e6c9a69","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-06-29T14:38:04Z","title_canon_sha256":"4a09ad0a971a1316548bb2f5ea7c1f1b0a0683f9cb489b4dea53050dcd3cdc68"},"schema_version":"1.0","source":{"id":"2506.23264","kind":"arxiv","version":1}},"canonical_sha256":"1d7ee89ebe0a4fac44a15daff030df700c7a04629ba823cae175f68d7764f557","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1d7ee89ebe0a4fac44a15daff030df700c7a04629ba823cae175f68d7764f557","first_computed_at":"2026-07-05T11:29:18.822708Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:29:18.822708Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lSJe5USZLkQGd5Sjur0VaNHNseddIzVyaqyRXPcB3HR/AdrdD8kkYEmbOLMEca6xMWEmPH+1Q0hu3y3cRnFYBw==","signature_status":"signed_v1","signed_at":"2026-07-05T11:29:18.823282Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.23264","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3e2f372809194fa8c24e487db8b98fcdcb37ca94f4ee22cb49938fa47f407d8c","sha256:7831eda9cc2fd5efffde26e8c3ac1f909d7c5a8ac17a076ee7c138e6c457ce8d"],"state_sha256":"bbaf5cb0ea9dff8de3d4d35ed59df465ba647c67e7b93072f822c5601390f744"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M9BYf7o8IcXTPQNhx4MxtFzxJ8y5a2+Q3SbZ+D1/LRXxlOj21Enmf5ZcHGEx/T3Qi9ahXuJAy0eUMBDOtw5YDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T11:10:38.170134Z","bundle_sha256":"e72c6a9c108c1b970ebc21d128d257ebb1a6920fbd6dd05a58c4d249f2d2b1d0"}}