{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:SWSIDIT225MEYTLUCF4LPRNFXD","short_pith_number":"pith:SWSIDIT2","schema_version":"1.0","canonical_sha256":"95a481a27ad7584c4d741178b7c5a5b8f06527a6594a991d1c9f5018ee64ed65","source":{"kind":"arxiv","id":"2411.12738","version":1},"attestation_state":"computed","paper":{"title":"Tiling randomly perturbed bipartite graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Enrique Gomez-Leos, Ryan R. Martin","submitted_at":"2024-11-19T18:58:47Z","abstract_excerpt":"A perfect $H$-tiling in a graph $G$ is a collection of vertex-disjoint copies of a graph $H$ in $G$ that covers all vertices of $G$. Motivated by papers of Bush and Zhao and of Balogh, Treglown, and Wagner, we determine the threshold for the existence of a perfect $K_{h,h}$-tiling of a randomly perturbed bipartite graph with linear minimum degree."},"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":"2411.12738","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-11-19T18:58:47Z","cross_cats_sorted":[],"title_canon_sha256":"a9c8b2bad4b79253f98225add2f3585a8850d576636a89c650fbba8156b865bd","abstract_canon_sha256":"362ac6042b48250735f5759c4a7b4127661e0adbcbc024a969a40ecaa55c5513"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:37:47.512298Z","signature_b64":"AM5C4eAadduwIpjUkKH2c9B7dhP0GtLyJpldvuWlY9DAAIj1XN2eLJahK12E/6rUPFHN4AKBcXXXvtPy3LlgCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"95a481a27ad7584c4d741178b7c5a5b8f06527a6594a991d1c9f5018ee64ed65","last_reissued_at":"2026-07-05T09:37:47.511769Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:37:47.511769Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tiling randomly perturbed bipartite graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Enrique Gomez-Leos, Ryan R. Martin","submitted_at":"2024-11-19T18:58:47Z","abstract_excerpt":"A perfect $H$-tiling in a graph $G$ is a collection of vertex-disjoint copies of a graph $H$ in $G$ that covers all vertices of $G$. Motivated by papers of Bush and Zhao and of Balogh, Treglown, and Wagner, we determine the threshold for the existence of a perfect $K_{h,h}$-tiling of a randomly perturbed bipartite graph with linear minimum degree."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.12738","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/2411.12738/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":"2411.12738","created_at":"2026-07-05T09:37:47.511836+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.12738v1","created_at":"2026-07-05T09:37:47.511836+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.12738","created_at":"2026-07-05T09:37:47.511836+00:00"},{"alias_kind":"pith_short_12","alias_value":"SWSIDIT225ME","created_at":"2026-07-05T09:37:47.511836+00:00"},{"alias_kind":"pith_short_16","alias_value":"SWSIDIT225MEYTLU","created_at":"2026-07-05T09:37:47.511836+00:00"},{"alias_kind":"pith_short_8","alias_value":"SWSIDIT2","created_at":"2026-07-05T09:37:47.511836+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/SWSIDIT225MEYTLUCF4LPRNFXD","json":"https://pith.science/pith/SWSIDIT225MEYTLUCF4LPRNFXD.json","graph_json":"https://pith.science/api/pith-number/SWSIDIT225MEYTLUCF4LPRNFXD/graph.json","events_json":"https://pith.science/api/pith-number/SWSIDIT225MEYTLUCF4LPRNFXD/events.json","paper":"https://pith.science/paper/SWSIDIT2"},"agent_actions":{"view_html":"https://pith.science/pith/SWSIDIT225MEYTLUCF4LPRNFXD","download_json":"https://pith.science/pith/SWSIDIT225MEYTLUCF4LPRNFXD.json","view_paper":"https://pith.science/paper/SWSIDIT2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.12738&json=true","fetch_graph":"https://pith.science/api/pith-number/SWSIDIT225MEYTLUCF4LPRNFXD/graph.json","fetch_events":"https://pith.science/api/pith-number/SWSIDIT225MEYTLUCF4LPRNFXD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SWSIDIT225MEYTLUCF4LPRNFXD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SWSIDIT225MEYTLUCF4LPRNFXD/action/storage_attestation","attest_author":"https://pith.science/pith/SWSIDIT225MEYTLUCF4LPRNFXD/action/author_attestation","sign_citation":"https://pith.science/pith/SWSIDIT225MEYTLUCF4LPRNFXD/action/citation_signature","submit_replication":"https://pith.science/pith/SWSIDIT225MEYTLUCF4LPRNFXD/action/replication_record"}},"created_at":"2026-07-05T09:37:47.511836+00:00","updated_at":"2026-07-05T09:37:47.511836+00:00"}