{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:L2LG6TP6U2YDMRZ6ELKUXY7AXR","short_pith_number":"pith:L2LG6TP6","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"},"canonical_sha256":"5e966f4dfea6b036473e22d54be3e0bc53b136c99fc123e4d71c3ef9a7e0f280","source":{"kind":"arxiv","id":"2606.09736","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.09736","created_at":"2026-06-09T02:09:06Z"},{"alias_kind":"arxiv_version","alias_value":"2606.09736v1","created_at":"2026-06-09T02:09:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.09736","created_at":"2026-06-09T02:09:06Z"},{"alias_kind":"pith_short_12","alias_value":"L2LG6TP6U2YD","created_at":"2026-06-09T02:09:06Z"},{"alias_kind":"pith_short_16","alias_value":"L2LG6TP6U2YDMRZ6","created_at":"2026-06-09T02:09:06Z"},{"alias_kind":"pith_short_8","alias_value":"L2LG6TP6","created_at":"2026-06-09T02:09:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:L2LG6TP6U2YDMRZ6ELKUXY7AXR","target":"record","payload":{"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"},"canonical_sha256":"5e966f4dfea6b036473e22d54be3e0bc53b136c99fc123e4d71c3ef9a7e0f280","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"},"source_kind":"arxiv","source_id":"2606.09736","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-09T02:09:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tnxMrtver2BdM3OuJYbiKQpU6nrOTbgcyW1cqIOaIY58r/1dEnXlSQIQdjidNJ1IUkEE26laNZFJx4A59tUBCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-12T08:44:10.304535Z"},"content_sha256":"42034884e45fe85078c7678ca8a717266e435a1f0a1ef2c6a232097c500d70ae","schema_version":"1.0","event_id":"sha256:42034884e45fe85078c7678ca8a717266e435a1f0a1ef2c6a232097c500d70ae"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:L2LG6TP6U2YDMRZ6ELKUXY7AXR","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-09T02:09:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+YgUiPZvBxyR96cTglLi/mV3CuizBuO+IIyd2INUKmB1XQGAYsOG3MSS3k8jkM6lzUgJ9NaNY9gx92gEkuPOBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-12T08:44:10.304927Z"},"content_sha256":"0b14e94466fc6d5f8a835d90b3d9f9043b74a790042a114b5b0dee779d558fac","schema_version":"1.0","event_id":"sha256:0b14e94466fc6d5f8a835d90b3d9f9043b74a790042a114b5b0dee779d558fac"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/L2LG6TP6U2YDMRZ6ELKUXY7AXR/bundle.json","state_url":"https://pith.science/pith/L2LG6TP6U2YDMRZ6ELKUXY7AXR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/L2LG6TP6U2YDMRZ6ELKUXY7AXR/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-12T08:44:10Z","links":{"resolver":"https://pith.science/pith/L2LG6TP6U2YDMRZ6ELKUXY7AXR","bundle":"https://pith.science/pith/L2LG6TP6U2YDMRZ6ELKUXY7AXR/bundle.json","state":"https://pith.science/pith/L2LG6TP6U2YDMRZ6ELKUXY7AXR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/L2LG6TP6U2YDMRZ6ELKUXY7AXR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:L2LG6TP6U2YDMRZ6ELKUXY7AXR","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"49feec2ac49331c1249aff34c27ec27f10286d4f1090193037e728b72be202af","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-08T17:00:40Z","title_canon_sha256":"6c4075a4f128689389eb910a2b16e5d651e7456e55e25521aef192e30035a22b"},"schema_version":"1.0","source":{"id":"2606.09736","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.09736","created_at":"2026-06-09T02:09:06Z"},{"alias_kind":"arxiv_version","alias_value":"2606.09736v1","created_at":"2026-06-09T02:09:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.09736","created_at":"2026-06-09T02:09:06Z"},{"alias_kind":"pith_short_12","alias_value":"L2LG6TP6U2YD","created_at":"2026-06-09T02:09:06Z"},{"alias_kind":"pith_short_16","alias_value":"L2LG6TP6U2YDMRZ6","created_at":"2026-06-09T02:09:06Z"},{"alias_kind":"pith_short_8","alias_value":"L2LG6TP6","created_at":"2026-06-09T02:09:06Z"}],"graph_snapshots":[{"event_id":"sha256:0b14e94466fc6d5f8a835d90b3d9f9043b74a790042a114b5b0dee779d558fac","target":"graph","created_at":"2026-06-09T02:09:06Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2606.09736/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Andrzej Dudek, Patrick Bennett, Ryan Cushman, Xavier P\\'erez-Gim\\'enez","cross_cats":["cs.DM"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-08T17:00:40Z","title":"Almost-perfect packings and Tuza's conjecture in the random geometric graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.09736","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:42034884e45fe85078c7678ca8a717266e435a1f0a1ef2c6a232097c500d70ae","target":"record","created_at":"2026-06-09T02:09:06Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"49feec2ac49331c1249aff34c27ec27f10286d4f1090193037e728b72be202af","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-08T17:00:40Z","title_canon_sha256":"6c4075a4f128689389eb910a2b16e5d651e7456e55e25521aef192e30035a22b"},"schema_version":"1.0","source":{"id":"2606.09736","kind":"arxiv","version":1}},"canonical_sha256":"5e966f4dfea6b036473e22d54be3e0bc53b136c99fc123e4d71c3ef9a7e0f280","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5e966f4dfea6b036473e22d54be3e0bc53b136c99fc123e4d71c3ef9a7e0f280","first_computed_at":"2026-06-09T02:09:06.820827Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-09T02:09:06.820827Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"F67rkj6Ac/0J7xL83a9k9jsErAuiOte6FUphMEy3kfAy5F7lQle1swA3kxAqg41ksugIzocYoIpf75DLTBLoCg==","signature_status":"signed_v1","signed_at":"2026-06-09T02:09:06.821748Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.09736","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:42034884e45fe85078c7678ca8a717266e435a1f0a1ef2c6a232097c500d70ae","sha256:0b14e94466fc6d5f8a835d90b3d9f9043b74a790042a114b5b0dee779d558fac"],"state_sha256":"0e304ecb58fe0e094d0781b36e25cd3224d936724604e1cd149fa0525b382c6f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H0882gQNOATdIgY38uE46xLn4z1RriWQvm0qgxyhSgvGIFBMYXPMbvxEGtzGS9t/vTwL0UiucGNq7BBWFpOvDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-12T08:44:10.307125Z","bundle_sha256":"7f33ef9c56018c79730959142f3432d1274d961eb110126e4825e3770b52634a"}}