{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:T5B7HCPYIQDZDCR44UCTN6ZZIC","short_pith_number":"pith:T5B7HCPY","canonical_record":{"source":{"id":"2604.25250","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-04-28T05:57:26Z","cross_cats_sorted":[],"title_canon_sha256":"6ca353331535e8c67d4a8319be0768a19dfd627c5e93cc352e656771af13d648","abstract_canon_sha256":"eb897e06870c25989ab382d967175c80b6158a1a39a1e1d679ae58a43f41177b"},"schema_version":"1.0"},"canonical_sha256":"9f43f389f84407918a3ce50536fb39408c403e225b4b891ce4d4c39006534dc7","source":{"kind":"arxiv","id":"2604.25250","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.25250","created_at":"2026-06-11T01:09:36Z"},{"alias_kind":"arxiv_version","alias_value":"2604.25250v2","created_at":"2026-06-11T01:09:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.25250","created_at":"2026-06-11T01:09:36Z"},{"alias_kind":"pith_short_12","alias_value":"T5B7HCPYIQDZ","created_at":"2026-06-11T01:09:36Z"},{"alias_kind":"pith_short_16","alias_value":"T5B7HCPYIQDZDCR4","created_at":"2026-06-11T01:09:36Z"},{"alias_kind":"pith_short_8","alias_value":"T5B7HCPY","created_at":"2026-06-11T01:09:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:T5B7HCPYIQDZDCR44UCTN6ZZIC","target":"record","payload":{"canonical_record":{"source":{"id":"2604.25250","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-04-28T05:57:26Z","cross_cats_sorted":[],"title_canon_sha256":"6ca353331535e8c67d4a8319be0768a19dfd627c5e93cc352e656771af13d648","abstract_canon_sha256":"eb897e06870c25989ab382d967175c80b6158a1a39a1e1d679ae58a43f41177b"},"schema_version":"1.0"},"canonical_sha256":"9f43f389f84407918a3ce50536fb39408c403e225b4b891ce4d4c39006534dc7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-11T01:09:36.482980Z","signature_b64":"JJTy+z/KDQLIaSnrx/BBTmdftP3xn3qgZAHpkaLwdcXNkfhedld40ZGMzfLXfsdBbDyY2wTaOvMPzjqtm7k3BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9f43f389f84407918a3ce50536fb39408c403e225b4b891ce4d4c39006534dc7","last_reissued_at":"2026-06-11T01:09:36.481940Z","signature_status":"signed_v1","first_computed_at":"2026-06-11T01:09:36.481940Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2604.25250","source_version":2,"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-11T01:09:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7GMHEMCh+aYxH/+tAGteI5IedzStCyY8QB7a7RL5SN6XyOSRyu7We3O+1G5v38jsmDGiezS4uy3sGYFG1BpUDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T04:01:34.019124Z"},"content_sha256":"930fd439c67a6581842218f8437f277601dbeaa065cb972c8131c722a176e5fb","schema_version":"1.0","event_id":"sha256:930fd439c67a6581842218f8437f277601dbeaa065cb972c8131c722a176e5fb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:T5B7HCPYIQDZDCR44UCTN6ZZIC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Triangle packings in randomly perturbed graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"A dn-regular graph unioned with random G(n,p) for p above 2d/(1+2d) admits a triangle packing covering all but o(n²) edges with high probability, and the bound is sharp for d at most 1/2.","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hong Liu, Lanchao Wang, Xinbu Cheng, Zhifei Yan","submitted_at":"2026-04-28T05:57:26Z","abstract_excerpt":"The longstanding Nash-Williams conjecture asserts that every $K_3$-divisible graph $G$ with $\\delta(G)\\ge 3n/4$ admits a triangle decomposition. In the random setting, Frankl and R\\\"odl showed that, with high probability, $G(n,p)$ contains a triangle packing covering all but $o(n^2p)$ edges whenever $p\\ge n^{-1/2+\\varepsilon}$.\n  In this paper, we study near-perfect triangle packings in randomly perturbed graphs. We prove that for every $d>0$ and every $p>2d/(1+2d)$, if $G_d$ is a $dn$-regular graph on $n$ vertices, then with high probability the union $G_d\\cup G(n,p)$ contains a triangle pack"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"for every d>0 and every p>2d/(1+2d), if G_d is a dn-regular graph on n vertices, then with high probability the union G_d ∪ G(n,p) contains a triangle packing covering all but o(n²) edges. Moreover, this bound on p is best possible for 0<d≤1/2.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The random graph G(n,p) is generated independently of the fixed dn-regular graph G_d, and the new triangle-weighting lemma for weighted complete graphs applies directly to the edge weights arising in the perturbed graph without further restrictions.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"For any dn-regular graph perturbed by G(n,p) with p > 2d/(1+2d), there is whp a triangle packing covering all but o(n²) edges, and the bound is optimal for 0 < d ≤ 1/2.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"A dn-regular graph unioned with random G(n,p) for p above 2d/(1+2d) admits a triangle packing covering all but o(n²) edges with high probability, and the bound is sharp for d at most 1/2.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"79388962555c17a49a2a89893c4d334a5f71f9d1a839f9947bfb53d077700ad9"},"source":{"id":"2604.25250","kind":"arxiv","version":2},"verdict":{"id":"a2c964ee-8bc2-410e-ad71-fb2c631acf39","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-07T16:00:46.631172Z","strongest_claim":"for every d>0 and every p>2d/(1+2d), if G_d is a dn-regular graph on n vertices, then with high probability the union G_d ∪ G(n,p) contains a triangle packing covering all but o(n²) edges. Moreover, this bound on p is best possible for 0<d≤1/2.","one_line_summary":"For any dn-regular graph perturbed by G(n,p) with p > 2d/(1+2d), there is whp a triangle packing covering all but o(n²) edges, and the bound is optimal for 0 < d ≤ 1/2.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The random graph G(n,p) is generated independently of the fixed dn-regular graph G_d, and the new triangle-weighting lemma for weighted complete graphs applies directly to the edge weights arising in the perturbed graph without further restrictions.","pith_extraction_headline":"A dn-regular graph unioned with random G(n,p) for p above 2d/(1+2d) admits a triangle packing covering all but o(n²) edges with high probability, and the bound is sharp for d at most 1/2."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2604.25250/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"ai_meta_artifact","ran_at":"2026-05-21T05:34:34.555281Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T21:15:24.986961Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"c3200446c04ca694fc8eeeeb6833ea5cc36dbe386f11a5b9656de6673202f296"},"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":"a2c964ee-8bc2-410e-ad71-fb2c631acf39"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-11T01:09:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RKxs4W9FtjzrlioLnv4x1COmfS8xrOsPvlzZGJfIDXWnRE9MshCzi7slCBLsr7rq3w+c8I0NQmE70TxamU+SBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T04:01:34.019710Z"},"content_sha256":"2a018ed2459e5f0289b9f0afe7a8b8bcbc9adb80402f08a91363c1896a2aff26","schema_version":"1.0","event_id":"sha256:2a018ed2459e5f0289b9f0afe7a8b8bcbc9adb80402f08a91363c1896a2aff26"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/T5B7HCPYIQDZDCR44UCTN6ZZIC/bundle.json","state_url":"https://pith.science/pith/T5B7HCPYIQDZDCR44UCTN6ZZIC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/T5B7HCPYIQDZDCR44UCTN6ZZIC/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-06-23T04:01:34Z","links":{"resolver":"https://pith.science/pith/T5B7HCPYIQDZDCR44UCTN6ZZIC","bundle":"https://pith.science/pith/T5B7HCPYIQDZDCR44UCTN6ZZIC/bundle.json","state":"https://pith.science/pith/T5B7HCPYIQDZDCR44UCTN6ZZIC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/T5B7HCPYIQDZDCR44UCTN6ZZIC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:T5B7HCPYIQDZDCR44UCTN6ZZIC","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":"eb897e06870c25989ab382d967175c80b6158a1a39a1e1d679ae58a43f41177b","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-04-28T05:57:26Z","title_canon_sha256":"6ca353331535e8c67d4a8319be0768a19dfd627c5e93cc352e656771af13d648"},"schema_version":"1.0","source":{"id":"2604.25250","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.25250","created_at":"2026-06-11T01:09:36Z"},{"alias_kind":"arxiv_version","alias_value":"2604.25250v2","created_at":"2026-06-11T01:09:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.25250","created_at":"2026-06-11T01:09:36Z"},{"alias_kind":"pith_short_12","alias_value":"T5B7HCPYIQDZ","created_at":"2026-06-11T01:09:36Z"},{"alias_kind":"pith_short_16","alias_value":"T5B7HCPYIQDZDCR4","created_at":"2026-06-11T01:09:36Z"},{"alias_kind":"pith_short_8","alias_value":"T5B7HCPY","created_at":"2026-06-11T01:09:36Z"}],"graph_snapshots":[{"event_id":"sha256:2a018ed2459e5f0289b9f0afe7a8b8bcbc9adb80402f08a91363c1896a2aff26","target":"graph","created_at":"2026-06-11T01:09:36Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"for every d>0 and every p>2d/(1+2d), if G_d is a dn-regular graph on n vertices, then with high probability the union G_d ∪ G(n,p) contains a triangle packing covering all but o(n²) edges. Moreover, this bound on p is best possible for 0<d≤1/2."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The random graph G(n,p) is generated independently of the fixed dn-regular graph G_d, and the new triangle-weighting lemma for weighted complete graphs applies directly to the edge weights arising in the perturbed graph without further restrictions."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"For any dn-regular graph perturbed by G(n,p) with p > 2d/(1+2d), there is whp a triangle packing covering all but o(n²) edges, and the bound is optimal for 0 < d ≤ 1/2."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"A dn-regular graph unioned with random G(n,p) for p above 2d/(1+2d) admits a triangle packing covering all but o(n²) edges with high probability, and the bound is sharp for d at most 1/2."}],"snapshot_sha256":"79388962555c17a49a2a89893c4d334a5f71f9d1a839f9947bfb53d077700ad9"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-21T05:34:34.555281Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T21:15:24.986961Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2604.25250/integrity.json","findings":[],"snapshot_sha256":"c3200446c04ca694fc8eeeeb6833ea5cc36dbe386f11a5b9656de6673202f296","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The longstanding Nash-Williams conjecture asserts that every $K_3$-divisible graph $G$ with $\\delta(G)\\ge 3n/4$ admits a triangle decomposition. In the random setting, Frankl and R\\\"odl showed that, with high probability, $G(n,p)$ contains a triangle packing covering all but $o(n^2p)$ edges whenever $p\\ge n^{-1/2+\\varepsilon}$.\n  In this paper, we study near-perfect triangle packings in randomly perturbed graphs. We prove that for every $d>0$ and every $p>2d/(1+2d)$, if $G_d$ is a $dn$-regular graph on $n$ vertices, then with high probability the union $G_d\\cup G(n,p)$ contains a triangle pack","authors_text":"Hong Liu, Lanchao Wang, Xinbu Cheng, Zhifei Yan","cross_cats":[],"headline":"A dn-regular graph unioned with random G(n,p) for p above 2d/(1+2d) admits a triangle packing covering all but o(n²) edges with high probability, and the bound is sharp for d at most 1/2.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-04-28T05:57:26Z","title":"Triangle packings in randomly perturbed graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2604.25250","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-07T16:00:46.631172Z","id":"a2c964ee-8bc2-410e-ad71-fb2c631acf39","model_set":{"reader":"grok-4.3"},"one_line_summary":"For any dn-regular graph perturbed by G(n,p) with p > 2d/(1+2d), there is whp a triangle packing covering all but o(n²) edges, and the bound is optimal for 0 < d ≤ 1/2.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"A dn-regular graph unioned with random G(n,p) for p above 2d/(1+2d) admits a triangle packing covering all but o(n²) edges with high probability, and the bound is sharp for d at most 1/2.","strongest_claim":"for every d>0 and every p>2d/(1+2d), if G_d is a dn-regular graph on n vertices, then with high probability the union G_d ∪ G(n,p) contains a triangle packing covering all but o(n²) edges. Moreover, this bound on p is best possible for 0<d≤1/2.","weakest_assumption":"The random graph G(n,p) is generated independently of the fixed dn-regular graph G_d, and the new triangle-weighting lemma for weighted complete graphs applies directly to the edge weights arising in the perturbed graph without further restrictions."}},"verdict_id":"a2c964ee-8bc2-410e-ad71-fb2c631acf39"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:930fd439c67a6581842218f8437f277601dbeaa065cb972c8131c722a176e5fb","target":"record","created_at":"2026-06-11T01:09:36Z","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":"eb897e06870c25989ab382d967175c80b6158a1a39a1e1d679ae58a43f41177b","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-04-28T05:57:26Z","title_canon_sha256":"6ca353331535e8c67d4a8319be0768a19dfd627c5e93cc352e656771af13d648"},"schema_version":"1.0","source":{"id":"2604.25250","kind":"arxiv","version":2}},"canonical_sha256":"9f43f389f84407918a3ce50536fb39408c403e225b4b891ce4d4c39006534dc7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9f43f389f84407918a3ce50536fb39408c403e225b4b891ce4d4c39006534dc7","first_computed_at":"2026-06-11T01:09:36.481940Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-11T01:09:36.481940Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JJTy+z/KDQLIaSnrx/BBTmdftP3xn3qgZAHpkaLwdcXNkfhedld40ZGMzfLXfsdBbDyY2wTaOvMPzjqtm7k3BQ==","signature_status":"signed_v1","signed_at":"2026-06-11T01:09:36.482980Z","signed_message":"canonical_sha256_bytes"},"source_id":"2604.25250","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:930fd439c67a6581842218f8437f277601dbeaa065cb972c8131c722a176e5fb","sha256:2a018ed2459e5f0289b9f0afe7a8b8bcbc9adb80402f08a91363c1896a2aff26"],"state_sha256":"50debbd3a85d3f905675dd3d513f3dbfa2ce127ddd847056a1ce2ce39f557ea9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2Gt864m01u3nrSiSDvil62ZZw1gl05fJql22/ZaTcxzqTDCwJ7nTY76kjZrOWLi5Obg+BvAz8M1oeIZjVDkuAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T04:01:34.022259Z","bundle_sha256":"580f4d5828071a359040267b214b74dae659d11e28d5f3298d49921584c8389e"}}