{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:FXUS7NVWFIK7MYDJA2BMRALGSV","short_pith_number":"pith:FXUS7NVW","schema_version":"1.0","canonical_sha256":"2de92fb6b62a15f660690682c88166955ebb98a98e54b0d6eea4e1e1c08d4f03","source":{"kind":"arxiv","id":"2402.17855","version":1},"attestation_state":"computed","paper":{"title":"Refined Absorption: A New Proof of the Existence Conjecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Luke Postle, Michelle Delcourt","submitted_at":"2024-02-27T19:43:46Z","abstract_excerpt":"The study of combinatorial designs has a rich history spanning nearly two centuries. In a recent breakthrough, the notorious Existence Conjecture for Combinatorial Designs dating back to the 1800s was proved in full by Keevash via the method of randomized algebraic constructions. Subsequently Glock, K\\\"{u}hn, Lo, and Osthus provided an alternate purely combinatorial proof of the Existence Conjecture via the method of iterative absorption. We introduce a novel method of refined absorption for designs; here as our first application of the method we provide a new alternate proof of the Existence "},"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":"2402.17855","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-02-27T19:43:46Z","cross_cats_sorted":[],"title_canon_sha256":"87a7c4dbd08b5882db7e3426a3a4b0b8f9d32a09fba6955158ce8f9ab39fe92c","abstract_canon_sha256":"a4c84f558d2b1ba089071fb0c747c33b08f0cad9b661dee1ed37afd16a8b60ad"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:50:09.088390Z","signature_b64":"Vqta5N2ORA6DLCj1ATgVS6oNrY9FkmZcisNmhpKPCF/y5d6hZHpMGyEsHGtwsA6Mzcys5nRLYSsvHftnbcVQBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2de92fb6b62a15f660690682c88166955ebb98a98e54b0d6eea4e1e1c08d4f03","last_reissued_at":"2026-07-05T07:50:09.087935Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:50:09.087935Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Refined Absorption: A New Proof of the Existence Conjecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Luke Postle, Michelle Delcourt","submitted_at":"2024-02-27T19:43:46Z","abstract_excerpt":"The study of combinatorial designs has a rich history spanning nearly two centuries. In a recent breakthrough, the notorious Existence Conjecture for Combinatorial Designs dating back to the 1800s was proved in full by Keevash via the method of randomized algebraic constructions. Subsequently Glock, K\\\"{u}hn, Lo, and Osthus provided an alternate purely combinatorial proof of the Existence Conjecture via the method of iterative absorption. We introduce a novel method of refined absorption for designs; here as our first application of the method we provide a new alternate proof of the Existence "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.17855","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/2402.17855/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":"2402.17855","created_at":"2026-07-05T07:50:09.087993+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.17855v1","created_at":"2026-07-05T07:50:09.087993+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.17855","created_at":"2026-07-05T07:50:09.087993+00:00"},{"alias_kind":"pith_short_12","alias_value":"FXUS7NVWFIK7","created_at":"2026-07-05T07:50:09.087993+00:00"},{"alias_kind":"pith_short_16","alias_value":"FXUS7NVWFIK7MYDJ","created_at":"2026-07-05T07:50:09.087993+00:00"},{"alias_kind":"pith_short_8","alias_value":"FXUS7NVW","created_at":"2026-07-05T07:50:09.087993+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.11178","citing_title":"A Proof of Nash-Williams' Conjecture","ref_index":15,"is_internal_anchor":false},{"citing_arxiv_id":"2605.31398","citing_title":"Universality for rainbow oriented cycles in perturbed digraphs","ref_index":16,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FXUS7NVWFIK7MYDJA2BMRALGSV","json":"https://pith.science/pith/FXUS7NVWFIK7MYDJA2BMRALGSV.json","graph_json":"https://pith.science/api/pith-number/FXUS7NVWFIK7MYDJA2BMRALGSV/graph.json","events_json":"https://pith.science/api/pith-number/FXUS7NVWFIK7MYDJA2BMRALGSV/events.json","paper":"https://pith.science/paper/FXUS7NVW"},"agent_actions":{"view_html":"https://pith.science/pith/FXUS7NVWFIK7MYDJA2BMRALGSV","download_json":"https://pith.science/pith/FXUS7NVWFIK7MYDJA2BMRALGSV.json","view_paper":"https://pith.science/paper/FXUS7NVW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.17855&json=true","fetch_graph":"https://pith.science/api/pith-number/FXUS7NVWFIK7MYDJA2BMRALGSV/graph.json","fetch_events":"https://pith.science/api/pith-number/FXUS7NVWFIK7MYDJA2BMRALGSV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FXUS7NVWFIK7MYDJA2BMRALGSV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FXUS7NVWFIK7MYDJA2BMRALGSV/action/storage_attestation","attest_author":"https://pith.science/pith/FXUS7NVWFIK7MYDJA2BMRALGSV/action/author_attestation","sign_citation":"https://pith.science/pith/FXUS7NVWFIK7MYDJA2BMRALGSV/action/citation_signature","submit_replication":"https://pith.science/pith/FXUS7NVWFIK7MYDJA2BMRALGSV/action/replication_record"}},"created_at":"2026-07-05T07:50:09.087993+00:00","updated_at":"2026-07-05T07:50:09.087993+00:00"}