{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:UPOCRUEU2GUIXF7EADD6UMOJBA","short_pith_number":"pith:UPOCRUEU","schema_version":"1.0","canonical_sha256":"a3dc28d094d1a88b97e400c7ea31c908146bf3186facd35e00e98c1efa7f9cae","source":{"kind":"arxiv","id":"2505.05606","version":1},"attestation_state":"computed","paper":{"title":"Perfect tilings of 3-graphs with the generalised triangle","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Amarja Kathapurkar, Candida Bowtell, Natasha Morrison, Richard Mycroft","submitted_at":"2025-05-08T19:31:50Z","abstract_excerpt":"We establish a best-possible minimum codegree condition for the existence of a perfect tiling of a $3$-uniform hypergraph $H$ with copies of the generalised triangle $T$, which is the 3-uniform hypergraph with five vertices $a, b, c, d, e$ and three edges $abc$, $abd$, $cde$. We also give an asymptotically-optimal minimum codegree condition for the rainbow version of the problem."},"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":"2505.05606","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-05-08T19:31:50Z","cross_cats_sorted":[],"title_canon_sha256":"79088304ac8a8d8a49cd8887cfab1123687189db623f9d89c82d176962449183","abstract_canon_sha256":"3d71b64ef72eca9ed1a3ae4d8ee26de4fd20dece62255ca6c704021c7eb8a334"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:00:28.904954Z","signature_b64":"L/Cwuhz9XqcwqHOTr1P5+ZW9fBiIPvR039ICBtBtGeK7vYY3s0fdqv/mOJ2SZK0SXJCxkpIjTiuXmjKlDPKeDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a3dc28d094d1a88b97e400c7ea31c908146bf3186facd35e00e98c1efa7f9cae","last_reissued_at":"2026-07-05T11:00:28.904423Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:00:28.904423Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Perfect tilings of 3-graphs with the generalised triangle","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Amarja Kathapurkar, Candida Bowtell, Natasha Morrison, Richard Mycroft","submitted_at":"2025-05-08T19:31:50Z","abstract_excerpt":"We establish a best-possible minimum codegree condition for the existence of a perfect tiling of a $3$-uniform hypergraph $H$ with copies of the generalised triangle $T$, which is the 3-uniform hypergraph with five vertices $a, b, c, d, e$ and three edges $abc$, $abd$, $cde$. We also give an asymptotically-optimal minimum codegree condition for the rainbow version of the problem."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.05606","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/2505.05606/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":"2505.05606","created_at":"2026-07-05T11:00:28.904495+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.05606v1","created_at":"2026-07-05T11:00:28.904495+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.05606","created_at":"2026-07-05T11:00:28.904495+00:00"},{"alias_kind":"pith_short_12","alias_value":"UPOCRUEU2GUI","created_at":"2026-07-05T11:00:28.904495+00:00"},{"alias_kind":"pith_short_16","alias_value":"UPOCRUEU2GUIXF7E","created_at":"2026-07-05T11:00:28.904495+00:00"},{"alias_kind":"pith_short_8","alias_value":"UPOCRUEU","created_at":"2026-07-05T11:00:28.904495+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.11178","citing_title":"A Proof of Nash-Williams' Conjecture","ref_index":8,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UPOCRUEU2GUIXF7EADD6UMOJBA","json":"https://pith.science/pith/UPOCRUEU2GUIXF7EADD6UMOJBA.json","graph_json":"https://pith.science/api/pith-number/UPOCRUEU2GUIXF7EADD6UMOJBA/graph.json","events_json":"https://pith.science/api/pith-number/UPOCRUEU2GUIXF7EADD6UMOJBA/events.json","paper":"https://pith.science/paper/UPOCRUEU"},"agent_actions":{"view_html":"https://pith.science/pith/UPOCRUEU2GUIXF7EADD6UMOJBA","download_json":"https://pith.science/pith/UPOCRUEU2GUIXF7EADD6UMOJBA.json","view_paper":"https://pith.science/paper/UPOCRUEU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.05606&json=true","fetch_graph":"https://pith.science/api/pith-number/UPOCRUEU2GUIXF7EADD6UMOJBA/graph.json","fetch_events":"https://pith.science/api/pith-number/UPOCRUEU2GUIXF7EADD6UMOJBA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UPOCRUEU2GUIXF7EADD6UMOJBA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UPOCRUEU2GUIXF7EADD6UMOJBA/action/storage_attestation","attest_author":"https://pith.science/pith/UPOCRUEU2GUIXF7EADD6UMOJBA/action/author_attestation","sign_citation":"https://pith.science/pith/UPOCRUEU2GUIXF7EADD6UMOJBA/action/citation_signature","submit_replication":"https://pith.science/pith/UPOCRUEU2GUIXF7EADD6UMOJBA/action/replication_record"}},"created_at":"2026-07-05T11:00:28.904495+00:00","updated_at":"2026-07-05T11:00:28.904495+00:00"}