{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:DUFBDARLWHOGDUQ3SP4IJBCJXB","short_pith_number":"pith:DUFBDARL","canonical_record":{"source":{"id":"1706.05539","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-06-17T14:00:34Z","cross_cats_sorted":[],"title_canon_sha256":"9a543904f8b0bce94e2fbdb5de724d51ba7592e22f4d56fea27743c1b3f3240e","abstract_canon_sha256":"eea8d1155c9a9381cdce5c2d9257f862308cba4ca22f727537d7525fa4f80957"},"schema_version":"1.0"},"canonical_sha256":"1d0a11822bb1dc61d21b93f8848449b86dff64a00868fa04537e6f8ffbb4cb8d","source":{"kind":"arxiv","id":"1706.05539","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.05539","created_at":"2026-05-17T23:49:33Z"},{"alias_kind":"arxiv_version","alias_value":"1706.05539v2","created_at":"2026-05-17T23:49:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.05539","created_at":"2026-05-17T23:49:33Z"},{"alias_kind":"pith_short_12","alias_value":"DUFBDARLWHOG","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"DUFBDARLWHOGDUQ3","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"DUFBDARL","created_at":"2026-05-18T12:31:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:DUFBDARLWHOGDUQ3SP4IJBCJXB","target":"record","payload":{"canonical_record":{"source":{"id":"1706.05539","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-06-17T14:00:34Z","cross_cats_sorted":[],"title_canon_sha256":"9a543904f8b0bce94e2fbdb5de724d51ba7592e22f4d56fea27743c1b3f3240e","abstract_canon_sha256":"eea8d1155c9a9381cdce5c2d9257f862308cba4ca22f727537d7525fa4f80957"},"schema_version":"1.0"},"canonical_sha256":"1d0a11822bb1dc61d21b93f8848449b86dff64a00868fa04537e6f8ffbb4cb8d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:49:33.898389Z","signature_b64":"TO+z2pzCk1hCX5axGfelRTMGnSpuodsepS6keBV3yNIBRFEhd60T2wjev0XwjKLL0lAEz8Jvt/Ctq3AYknFsBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1d0a11822bb1dc61d21b93f8848449b86dff64a00868fa04537e6f8ffbb4cb8d","last_reissued_at":"2026-05-17T23:49:33.897907Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:49:33.897907Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.05539","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-17T23:49:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jWSfNiuFAE5ZHglMJaBf+QXsx0m9B9xj5+z93j8Z8czVl/b5TJF0kUOkE4b0A4UdaPcB3r5s5izkDT7/sBfgBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T11:36:06.177332Z"},"content_sha256":"2a26100333abdab7f3b716694f39065071cf6969d27ac38f40890904d12fe658","schema_version":"1.0","event_id":"sha256:2a26100333abdab7f3b716694f39065071cf6969d27ac38f40890904d12fe658"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:DUFBDARLWHOGDUQ3SP4IJBCJXB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On small $n$-uniform hypergraphs with positive discrepancy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Danila Cherkashin, Fedor Petrov","submitted_at":"2017-06-17T14:00:34Z","abstract_excerpt":"A two-coloring of the vertices $V$ of the hypergraph $H=(V, E)$ by red and blue has discrepancy $d$ if $d$ is the largest difference between the number of red and blue points in any edge. Let $f(n)$ be the fewest number of edges in an $n$-uniform hypergraph without a coloring with discrepancy $0$. Erd\\H{o}s and S\\'os asked: is $f(n)$ unbounded?\n  N. Alon, D. J. Kleitman, C. Pomerance, M. Saks and P. Seymour proved upper and lower bounds in terms of the smallest non-divisor ($\\mbox{snd}$) of $n$. We refine the upper bound as follows: $$f (n) \\leq c \\log \\mbox{snd}\\ {n}.$$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.05539","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-17T23:49:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5rCnPN7Z930G4aPb1sApOaIwBhKcm2Wo9SdCMBLvcUuoPbgrFsACIx7gUzT1kURhdPqwxr9me5+dSySEu/y6Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T11:36:06.177682Z"},"content_sha256":"bda68f0a32cfa4e68ee74072e4232555d449c96a89e6e140941c180881216a1c","schema_version":"1.0","event_id":"sha256:bda68f0a32cfa4e68ee74072e4232555d449c96a89e6e140941c180881216a1c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DUFBDARLWHOGDUQ3SP4IJBCJXB/bundle.json","state_url":"https://pith.science/pith/DUFBDARLWHOGDUQ3SP4IJBCJXB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DUFBDARLWHOGDUQ3SP4IJBCJXB/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-06-01T11:36:06Z","links":{"resolver":"https://pith.science/pith/DUFBDARLWHOGDUQ3SP4IJBCJXB","bundle":"https://pith.science/pith/DUFBDARLWHOGDUQ3SP4IJBCJXB/bundle.json","state":"https://pith.science/pith/DUFBDARLWHOGDUQ3SP4IJBCJXB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DUFBDARLWHOGDUQ3SP4IJBCJXB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:DUFBDARLWHOGDUQ3SP4IJBCJXB","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":"eea8d1155c9a9381cdce5c2d9257f862308cba4ca22f727537d7525fa4f80957","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-06-17T14:00:34Z","title_canon_sha256":"9a543904f8b0bce94e2fbdb5de724d51ba7592e22f4d56fea27743c1b3f3240e"},"schema_version":"1.0","source":{"id":"1706.05539","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.05539","created_at":"2026-05-17T23:49:33Z"},{"alias_kind":"arxiv_version","alias_value":"1706.05539v2","created_at":"2026-05-17T23:49:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.05539","created_at":"2026-05-17T23:49:33Z"},{"alias_kind":"pith_short_12","alias_value":"DUFBDARLWHOG","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"DUFBDARLWHOGDUQ3","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"DUFBDARL","created_at":"2026-05-18T12:31:12Z"}],"graph_snapshots":[{"event_id":"sha256:bda68f0a32cfa4e68ee74072e4232555d449c96a89e6e140941c180881216a1c","target":"graph","created_at":"2026-05-17T23:49:33Z","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":"A two-coloring of the vertices $V$ of the hypergraph $H=(V, E)$ by red and blue has discrepancy $d$ if $d$ is the largest difference between the number of red and blue points in any edge. Let $f(n)$ be the fewest number of edges in an $n$-uniform hypergraph without a coloring with discrepancy $0$. Erd\\H{o}s and S\\'os asked: is $f(n)$ unbounded?\n  N. Alon, D. J. Kleitman, C. Pomerance, M. Saks and P. Seymour proved upper and lower bounds in terms of the smallest non-divisor ($\\mbox{snd}$) of $n$. We refine the upper bound as follows: $$f (n) \\leq c \\log \\mbox{snd}\\ {n}.$$","authors_text":"Danila Cherkashin, Fedor Petrov","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-06-17T14:00:34Z","title":"On small $n$-uniform hypergraphs with positive discrepancy"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.05539","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:2a26100333abdab7f3b716694f39065071cf6969d27ac38f40890904d12fe658","target":"record","created_at":"2026-05-17T23:49:33Z","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":"eea8d1155c9a9381cdce5c2d9257f862308cba4ca22f727537d7525fa4f80957","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-06-17T14:00:34Z","title_canon_sha256":"9a543904f8b0bce94e2fbdb5de724d51ba7592e22f4d56fea27743c1b3f3240e"},"schema_version":"1.0","source":{"id":"1706.05539","kind":"arxiv","version":2}},"canonical_sha256":"1d0a11822bb1dc61d21b93f8848449b86dff64a00868fa04537e6f8ffbb4cb8d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1d0a11822bb1dc61d21b93f8848449b86dff64a00868fa04537e6f8ffbb4cb8d","first_computed_at":"2026-05-17T23:49:33.897907Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:49:33.897907Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TO+z2pzCk1hCX5axGfelRTMGnSpuodsepS6keBV3yNIBRFEhd60T2wjev0XwjKLL0lAEz8Jvt/Ctq3AYknFsBA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:49:33.898389Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.05539","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2a26100333abdab7f3b716694f39065071cf6969d27ac38f40890904d12fe658","sha256:bda68f0a32cfa4e68ee74072e4232555d449c96a89e6e140941c180881216a1c"],"state_sha256":"e8550845211801334a4432874a1e2834af510899fb4ea00e97f1398d8c89b284"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aFJeXwwDmr6MfjvyQ1jR9/4LvNVuQVGYktoLSaqPBf0EelWgtba8VZp6q6IOlDrjKE7oW1/ZgjG6D8OimJl5Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T11:36:06.179662Z","bundle_sha256":"192ebff5e4c067b81abf40f8bc40dd322154d50751fd5d354318ee76a33460ec"}}