{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:RVC36E3J6CUK43HNSEP67NA6MK","short_pith_number":"pith:RVC36E3J","schema_version":"1.0","canonical_sha256":"8d45bf1369f0a8ae6ced911fefb41e629a71049c8ae81db5ea2ca414235fefab","source":{"kind":"arxiv","id":"1904.01394","version":2},"attestation_state":"computed","paper":{"title":"Completion and deficiency problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Adam Zsolt Wagner, Benny Sudakov, Rajko Nenadov","submitted_at":"2019-04-02T13:12:47Z","abstract_excerpt":"Given a partial Steiner triple system (STS) of order $n$, what is the order of the smallest complete STS it can be embedded into? The study of this question goes back more than 40 years. In this paper we answer it for relatively sparse STSs, showing that given a partial STS of order $n$ with at most $r \\le \\varepsilon n^2$ triples, it can always be embedded into a complete STS of order $n+O(\\sqrt{r})$, which is asymptotically optimal. We also obtain similar results for completions of Latin squares and other designs.\n  This suggests a new, natural class of questions, called deficiency problems."},"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":"1904.01394","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-04-02T13:12:47Z","cross_cats_sorted":[],"title_canon_sha256":"1645f01bb2b3024209985c089642e0a664df03bed154358b4a9b11cf1ea49456","abstract_canon_sha256":"8c16513b096528092d21a75b10045c82b0172a9bab89ab9b97c6f36011ee576d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:24.488372Z","signature_b64":"i1D+Abt2QE+25AGn9FcyAihZ+Ah5qAwcUQLEpCNG0JoQOJY31FXGnMU86yzKIPptBmesKo4Tr7GTE+1F77+IBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8d45bf1369f0a8ae6ced911fefb41e629a71049c8ae81db5ea2ca414235fefab","last_reissued_at":"2026-05-17T23:39:24.487808Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:24.487808Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Completion and deficiency problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Adam Zsolt Wagner, Benny Sudakov, Rajko Nenadov","submitted_at":"2019-04-02T13:12:47Z","abstract_excerpt":"Given a partial Steiner triple system (STS) of order $n$, what is the order of the smallest complete STS it can be embedded into? The study of this question goes back more than 40 years. In this paper we answer it for relatively sparse STSs, showing that given a partial STS of order $n$ with at most $r \\le \\varepsilon n^2$ triples, it can always be embedded into a complete STS of order $n+O(\\sqrt{r})$, which is asymptotically optimal. We also obtain similar results for completions of Latin squares and other designs.\n  This suggests a new, natural class of questions, called deficiency problems."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.01394","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1904.01394","created_at":"2026-05-17T23:39:24.487896+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.01394v2","created_at":"2026-05-17T23:39:24.487896+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.01394","created_at":"2026-05-17T23:39:24.487896+00:00"},{"alias_kind":"pith_short_12","alias_value":"RVC36E3J6CUK","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_16","alias_value":"RVC36E3J6CUK43HN","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_8","alias_value":"RVC36E3J","created_at":"2026-05-18T12:33:27.125529+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RVC36E3J6CUK43HNSEP67NA6MK","json":"https://pith.science/pith/RVC36E3J6CUK43HNSEP67NA6MK.json","graph_json":"https://pith.science/api/pith-number/RVC36E3J6CUK43HNSEP67NA6MK/graph.json","events_json":"https://pith.science/api/pith-number/RVC36E3J6CUK43HNSEP67NA6MK/events.json","paper":"https://pith.science/paper/RVC36E3J"},"agent_actions":{"view_html":"https://pith.science/pith/RVC36E3J6CUK43HNSEP67NA6MK","download_json":"https://pith.science/pith/RVC36E3J6CUK43HNSEP67NA6MK.json","view_paper":"https://pith.science/paper/RVC36E3J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.01394&json=true","fetch_graph":"https://pith.science/api/pith-number/RVC36E3J6CUK43HNSEP67NA6MK/graph.json","fetch_events":"https://pith.science/api/pith-number/RVC36E3J6CUK43HNSEP67NA6MK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RVC36E3J6CUK43HNSEP67NA6MK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RVC36E3J6CUK43HNSEP67NA6MK/action/storage_attestation","attest_author":"https://pith.science/pith/RVC36E3J6CUK43HNSEP67NA6MK/action/author_attestation","sign_citation":"https://pith.science/pith/RVC36E3J6CUK43HNSEP67NA6MK/action/citation_signature","submit_replication":"https://pith.science/pith/RVC36E3J6CUK43HNSEP67NA6MK/action/replication_record"}},"created_at":"2026-05-17T23:39:24.487896+00:00","updated_at":"2026-05-17T23:39:24.487896+00:00"}