{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:L2LG6TP6U2YDMRZ6ELKUXY7AXR","short_pith_number":"pith:L2LG6TP6","schema_version":"1.0","canonical_sha256":"5e966f4dfea6b036473e22d54be3e0bc53b136c99fc123e4d71c3ef9a7e0f280","source":{"kind":"arxiv","id":"2606.09736","version":1},"attestation_state":"computed","paper":{"title":"Almost-perfect packings and Tuza's conjecture in the random geometric graph","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Andrzej Dudek, Patrick Bennett, Ryan Cushman, Xavier P\\'erez-Gim\\'enez","submitted_at":"2026-06-08T17:00:40Z","abstract_excerpt":"The triangle packing number $\\nu(G)$ of a graph $G$ is the maximum size of a set of edge-disjoint triangles in $G$. Tuza conjectured that in any graph $G$ there exists a set of at most $2\\nu(G)$ edges intersecting every triangle in $G$. We show that Tuza's conjecture holds in the random geometric graph for a large range of densities. We also study the problem of covering almost all edges of the random geometric graph with edge-disjoint copies of some fixed graph $F$. In particular, we show the existence of almost-perfect packings for an infinite family of $F$, and state some negative results a"},"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":"2606.09736","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-08T17:00:40Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"6c4075a4f128689389eb910a2b16e5d651e7456e55e25521aef192e30035a22b","abstract_canon_sha256":"49feec2ac49331c1249aff34c27ec27f10286d4f1090193037e728b72be202af"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-09T02:09:06.821748Z","signature_b64":"F67rkj6Ac/0J7xL83a9k9jsErAuiOte6FUphMEy3kfAy5F7lQle1swA3kxAqg41ksugIzocYoIpf75DLTBLoCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5e966f4dfea6b036473e22d54be3e0bc53b136c99fc123e4d71c3ef9a7e0f280","last_reissued_at":"2026-06-09T02:09:06.820827Z","signature_status":"signed_v1","first_computed_at":"2026-06-09T02:09:06.820827Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Almost-perfect packings and Tuza's conjecture in the random geometric graph","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Andrzej Dudek, Patrick Bennett, Ryan Cushman, Xavier P\\'erez-Gim\\'enez","submitted_at":"2026-06-08T17:00:40Z","abstract_excerpt":"The triangle packing number $\\nu(G)$ of a graph $G$ is the maximum size of a set of edge-disjoint triangles in $G$. Tuza conjectured that in any graph $G$ there exists a set of at most $2\\nu(G)$ edges intersecting every triangle in $G$. We show that Tuza's conjecture holds in the random geometric graph for a large range of densities. We also study the problem of covering almost all edges of the random geometric graph with edge-disjoint copies of some fixed graph $F$. In particular, we show the existence of almost-perfect packings for an infinite family of $F$, and state some negative results a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.09736","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/2606.09736/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":"2606.09736","created_at":"2026-06-09T02:09:06.820993+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.09736v1","created_at":"2026-06-09T02:09:06.820993+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.09736","created_at":"2026-06-09T02:09:06.820993+00:00"},{"alias_kind":"pith_short_12","alias_value":"L2LG6TP6U2YD","created_at":"2026-06-09T02:09:06.820993+00:00"},{"alias_kind":"pith_short_16","alias_value":"L2LG6TP6U2YDMRZ6","created_at":"2026-06-09T02:09:06.820993+00:00"},{"alias_kind":"pith_short_8","alias_value":"L2LG6TP6","created_at":"2026-06-09T02:09:06.820993+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/L2LG6TP6U2YDMRZ6ELKUXY7AXR","json":"https://pith.science/pith/L2LG6TP6U2YDMRZ6ELKUXY7AXR.json","graph_json":"https://pith.science/api/pith-number/L2LG6TP6U2YDMRZ6ELKUXY7AXR/graph.json","events_json":"https://pith.science/api/pith-number/L2LG6TP6U2YDMRZ6ELKUXY7AXR/events.json","paper":"https://pith.science/paper/L2LG6TP6"},"agent_actions":{"view_html":"https://pith.science/pith/L2LG6TP6U2YDMRZ6ELKUXY7AXR","download_json":"https://pith.science/pith/L2LG6TP6U2YDMRZ6ELKUXY7AXR.json","view_paper":"https://pith.science/paper/L2LG6TP6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.09736&json=true","fetch_graph":"https://pith.science/api/pith-number/L2LG6TP6U2YDMRZ6ELKUXY7AXR/graph.json","fetch_events":"https://pith.science/api/pith-number/L2LG6TP6U2YDMRZ6ELKUXY7AXR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L2LG6TP6U2YDMRZ6ELKUXY7AXR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L2LG6TP6U2YDMRZ6ELKUXY7AXR/action/storage_attestation","attest_author":"https://pith.science/pith/L2LG6TP6U2YDMRZ6ELKUXY7AXR/action/author_attestation","sign_citation":"https://pith.science/pith/L2LG6TP6U2YDMRZ6ELKUXY7AXR/action/citation_signature","submit_replication":"https://pith.science/pith/L2LG6TP6U2YDMRZ6ELKUXY7AXR/action/replication_record"}},"created_at":"2026-06-09T02:09:06.820993+00:00","updated_at":"2026-06-09T02:09:06.820993+00:00"}