{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:JT3D6ELM7HW74DG5AUUBRJENEF","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":"1018061c30bf94842fbba836a5ae9db256ebb5a3e51c378855aeea40671edb52","cross_cats_sorted":["math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2026-06-29T03:37:28Z","title_canon_sha256":"f00fb6c379f1d51c9906bd39306b766ef532fa0f593d1828c737b7312ad6ebac"},"schema_version":"1.0","source":{"id":"2606.29743","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.29743","created_at":"2026-06-30T02:17:32Z"},{"alias_kind":"arxiv_version","alias_value":"2606.29743v1","created_at":"2026-06-30T02:17:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.29743","created_at":"2026-06-30T02:17:32Z"},{"alias_kind":"pith_short_12","alias_value":"JT3D6ELM7HW7","created_at":"2026-06-30T02:17:32Z"},{"alias_kind":"pith_short_16","alias_value":"JT3D6ELM7HW74DG5","created_at":"2026-06-30T02:17:32Z"},{"alias_kind":"pith_short_8","alias_value":"JT3D6ELM","created_at":"2026-06-30T02:17:32Z"}],"graph_snapshots":[{"event_id":"sha256:46bac1242417ecfc3fa5106f50ac5e16c83f283626e87e3550d202b69440117a","target":"graph","created_at":"2026-06-30T02:17:32Z","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.29743/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study $H$-packings in plane triangulations for the three-vertex graphs $H\\in\\{P_3,K_3,P_2\\cup P_1\\}$. For a graph $H$, let $\\lambda_H(G)$ denote the maximum size of an $H$-packing in $G$, with the convention that for $H=P_2\\cup P_1$ the copies are required to be induced. For $P_3$-packings, we prove that every triangulation $G$ on $n$ vertices satisfies $\\lambda_{P_3}(G)\\ge \\left\\lfloor \\frac n5\\right\\rfloor$, and show that this lower bound is asymptotically tight. We also study triangle packings in triangulations and provide lower bounds for $\\lambda_{K_3}(G)$ in terms of the maximum degre","authors_text":"Anil Maheshwari, Bobby Miraftab, Prosenjit Bose, Yota Otachi","cross_cats":["math.CO"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2026-06-29T03:37:28Z","title":"3-packings in Triangulations: Algorithms, bounds, and Complexity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.29743","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:0f045d6bc35abd0b6b15e2eef1f2bd2488c06d9cb583fc9a433666348468412b","target":"record","created_at":"2026-06-30T02:17:32Z","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":"1018061c30bf94842fbba836a5ae9db256ebb5a3e51c378855aeea40671edb52","cross_cats_sorted":["math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2026-06-29T03:37:28Z","title_canon_sha256":"f00fb6c379f1d51c9906bd39306b766ef532fa0f593d1828c737b7312ad6ebac"},"schema_version":"1.0","source":{"id":"2606.29743","kind":"arxiv","version":1}},"canonical_sha256":"4cf63f116cf9edfe0cdd052818a48d215fc01cb03f819e03f22f3ac7ca7b4ade","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4cf63f116cf9edfe0cdd052818a48d215fc01cb03f819e03f22f3ac7ca7b4ade","first_computed_at":"2026-06-30T02:17:32.967103Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-30T02:17:32.967103Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LJo9YxmQySgL+2K8a5dIkOZ/irH5K5zTHDPKqDV+5WRyeervDAjkWuT6WQGlMFlf3yb9imAgH/nhvAaytPB3BA==","signature_status":"signed_v1","signed_at":"2026-06-30T02:17:32.967830Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.29743","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0f045d6bc35abd0b6b15e2eef1f2bd2488c06d9cb583fc9a433666348468412b","sha256:46bac1242417ecfc3fa5106f50ac5e16c83f283626e87e3550d202b69440117a"],"state_sha256":"81d03b4fc7c5f5dbf28fc6857395f026d3f209927eb19fe4a9d5284e82d88421"}