{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:5ANFXIBJDGSAXKZ3MXL4F6TMGO","short_pith_number":"pith:5ANFXIBJ","schema_version":"1.0","canonical_sha256":"e81a5ba02919a40bab3b65d7c2fa6c33a0784a3600a404c362df4079259c9e10","source":{"kind":"arxiv","id":"2503.23252","version":3},"attestation_state":"computed","paper":{"title":"Steiner triple systems with high discrepancy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Amedeo Sgueglia, Lior Gishboliner, Stefan Glock","submitted_at":"2025-03-29T23:31:01Z","abstract_excerpt":"In this paper, we initiate the study of discrepancy questions for combinatorial designs. Specifically, we show that, for every fixed $r\\ge 3$ and $n\\equiv 1,3 \\pmod{6}$, any $r$-colouring of the triples on $[n]$ admits a Steiner triple system of order $n$ with discrepancy $\\Omega(n^2)$. This is not true for $r=2$, but we are able to asymptotically characterise all $2$-colourings which do not contain a Steiner triple system with high discrepancy. The key step in our proofs is a characterization of 3-uniform hypergraphs avoiding a certain natural type of induced subgraphs, contributing to the st"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2503.23252","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-03-29T23:31:01Z","cross_cats_sorted":[],"title_canon_sha256":"273c54f5024a7f4005cb600eb93da4384e49990b112524a3aedbde2c995aa083","abstract_canon_sha256":"864303f29ef06367a70f189dd306c6e274e3943f9027a0250c1e02477f3e014c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:42:53.849851Z","signature_b64":"oEhfYSILEdR0fcBMz0lJkT1t/y7ommBUzRTD2Hqk0fmc6XAzrJsaHkur3s+CVOHh9D9hmG5vLl44F+UbUE2hDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e81a5ba02919a40bab3b65d7c2fa6c33a0784a3600a404c362df4079259c9e10","last_reissued_at":"2026-07-05T11:42:53.849340Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:42:53.849340Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Steiner triple systems with high discrepancy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Amedeo Sgueglia, Lior Gishboliner, Stefan Glock","submitted_at":"2025-03-29T23:31:01Z","abstract_excerpt":"In this paper, we initiate the study of discrepancy questions for combinatorial designs. Specifically, we show that, for every fixed $r\\ge 3$ and $n\\equiv 1,3 \\pmod{6}$, any $r$-colouring of the triples on $[n]$ admits a Steiner triple system of order $n$ with discrepancy $\\Omega(n^2)$. This is not true for $r=2$, but we are able to asymptotically characterise all $2$-colourings which do not contain a Steiner triple system with high discrepancy. The key step in our proofs is a characterization of 3-uniform hypergraphs avoiding a certain natural type of induced subgraphs, contributing to the st"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.23252","kind":"arxiv","version":3},"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/2503.23252/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2503.23252","created_at":"2026-07-05T11:42:53.849402+00:00"},{"alias_kind":"arxiv_version","alias_value":"2503.23252v3","created_at":"2026-07-05T11:42:53.849402+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.23252","created_at":"2026-07-05T11:42:53.849402+00:00"},{"alias_kind":"pith_short_12","alias_value":"5ANFXIBJDGSA","created_at":"2026-07-05T11:42:53.849402+00:00"},{"alias_kind":"pith_short_16","alias_value":"5ANFXIBJDGSAXKZ3","created_at":"2026-07-05T11:42:53.849402+00:00"},{"alias_kind":"pith_short_8","alias_value":"5ANFXIBJ","created_at":"2026-07-05T11:42:53.849402+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.00492","citing_title":"An exact small-$n$ computation of the minimum 2-coloring discrepancy of $K_n^{(3)}$","ref_index":1,"is_internal_anchor":false},{"citing_arxiv_id":"2605.00492","citing_title":"An exact small-$n$ computation of the minimum 2-coloring discrepancy of $K_n^{(3)}$","ref_index":1,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5ANFXIBJDGSAXKZ3MXL4F6TMGO","json":"https://pith.science/pith/5ANFXIBJDGSAXKZ3MXL4F6TMGO.json","graph_json":"https://pith.science/api/pith-number/5ANFXIBJDGSAXKZ3MXL4F6TMGO/graph.json","events_json":"https://pith.science/api/pith-number/5ANFXIBJDGSAXKZ3MXL4F6TMGO/events.json","paper":"https://pith.science/paper/5ANFXIBJ"},"agent_actions":{"view_html":"https://pith.science/pith/5ANFXIBJDGSAXKZ3MXL4F6TMGO","download_json":"https://pith.science/pith/5ANFXIBJDGSAXKZ3MXL4F6TMGO.json","view_paper":"https://pith.science/paper/5ANFXIBJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2503.23252&json=true","fetch_graph":"https://pith.science/api/pith-number/5ANFXIBJDGSAXKZ3MXL4F6TMGO/graph.json","fetch_events":"https://pith.science/api/pith-number/5ANFXIBJDGSAXKZ3MXL4F6TMGO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5ANFXIBJDGSAXKZ3MXL4F6TMGO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5ANFXIBJDGSAXKZ3MXL4F6TMGO/action/storage_attestation","attest_author":"https://pith.science/pith/5ANFXIBJDGSAXKZ3MXL4F6TMGO/action/author_attestation","sign_citation":"https://pith.science/pith/5ANFXIBJDGSAXKZ3MXL4F6TMGO/action/citation_signature","submit_replication":"https://pith.science/pith/5ANFXIBJDGSAXKZ3MXL4F6TMGO/action/replication_record"}},"created_at":"2026-07-05T11:42:53.849402+00:00","updated_at":"2026-07-05T11:42:53.849402+00:00"}