{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:WF436HHCVQNJCXNLRGLE6LRZA6","short_pith_number":"pith:WF436HHC","schema_version":"1.0","canonical_sha256":"b179bf1ce2ac1a915dab89964f2e3907964ff575260e5f361d4e770665175f73","source":{"kind":"arxiv","id":"2506.07147","version":1},"attestation_state":"computed","paper":{"title":"Packing tetrahedrons in edge-weighted graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Donglei Yang, Shunan Wei, Wanting Sun","submitted_at":"2025-06-08T13:50:57Z","abstract_excerpt":"We prove that for all $\\mu>0, t\\in (0,1)$ and sufficiently large $n\\in 4\\mathbb{N}$, if $G$ is an edge-weighted complete graph on $n$ vertices with a weight function $w: E(G)\\rightarrow [0,1]$ and the minimum weighted degree $\\delta^w(G)\\geq (\\tfrac{1+3t}{4}+\\mu)n$, then $G$ contains a $K_4$-factor where each copy of $K_4$ has total weight more than $6t$. This confirms a conjecture of Balogh--Kemkes--Lee--Young for the tetrahedron case."},"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":"2506.07147","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-06-08T13:50:57Z","cross_cats_sorted":[],"title_canon_sha256":"7d172974b2846ac7b80d0cae6287e6c45520e121a14a8c758b7942e2bc8e0a32","abstract_canon_sha256":"f35c44a0043866ae327c48512bcd19fa9f0b8fb40925ed37ac9402f60dbb44cb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:18:02.457080Z","signature_b64":"Pk8jae8RBHudAQT+DWfYIAUQU+wg8NWhBdQ9UAcVmWYKCQHooEatcG9ulfmDdWOjbe5mzM+ZBngJW74YxaPWCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b179bf1ce2ac1a915dab89964f2e3907964ff575260e5f361d4e770665175f73","last_reissued_at":"2026-07-05T11:18:02.456603Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:18:02.456603Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Packing tetrahedrons in edge-weighted graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Donglei Yang, Shunan Wei, Wanting Sun","submitted_at":"2025-06-08T13:50:57Z","abstract_excerpt":"We prove that for all $\\mu>0, t\\in (0,1)$ and sufficiently large $n\\in 4\\mathbb{N}$, if $G$ is an edge-weighted complete graph on $n$ vertices with a weight function $w: E(G)\\rightarrow [0,1]$ and the minimum weighted degree $\\delta^w(G)\\geq (\\tfrac{1+3t}{4}+\\mu)n$, then $G$ contains a $K_4$-factor where each copy of $K_4$ has total weight more than $6t$. This confirms a conjecture of Balogh--Kemkes--Lee--Young for the tetrahedron case."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.07147","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/2506.07147/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":"2506.07147","created_at":"2026-07-05T11:18:02.456664+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.07147v1","created_at":"2026-07-05T11:18:02.456664+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.07147","created_at":"2026-07-05T11:18:02.456664+00:00"},{"alias_kind":"pith_short_12","alias_value":"WF436HHCVQNJ","created_at":"2026-07-05T11:18:02.456664+00:00"},{"alias_kind":"pith_short_16","alias_value":"WF436HHCVQNJCXNL","created_at":"2026-07-05T11:18:02.456664+00:00"},{"alias_kind":"pith_short_8","alias_value":"WF436HHC","created_at":"2026-07-05T11:18:02.456664+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/WF436HHCVQNJCXNLRGLE6LRZA6","json":"https://pith.science/pith/WF436HHCVQNJCXNLRGLE6LRZA6.json","graph_json":"https://pith.science/api/pith-number/WF436HHCVQNJCXNLRGLE6LRZA6/graph.json","events_json":"https://pith.science/api/pith-number/WF436HHCVQNJCXNLRGLE6LRZA6/events.json","paper":"https://pith.science/paper/WF436HHC"},"agent_actions":{"view_html":"https://pith.science/pith/WF436HHCVQNJCXNLRGLE6LRZA6","download_json":"https://pith.science/pith/WF436HHCVQNJCXNLRGLE6LRZA6.json","view_paper":"https://pith.science/paper/WF436HHC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.07147&json=true","fetch_graph":"https://pith.science/api/pith-number/WF436HHCVQNJCXNLRGLE6LRZA6/graph.json","fetch_events":"https://pith.science/api/pith-number/WF436HHCVQNJCXNLRGLE6LRZA6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WF436HHCVQNJCXNLRGLE6LRZA6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WF436HHCVQNJCXNLRGLE6LRZA6/action/storage_attestation","attest_author":"https://pith.science/pith/WF436HHCVQNJCXNLRGLE6LRZA6/action/author_attestation","sign_citation":"https://pith.science/pith/WF436HHCVQNJCXNLRGLE6LRZA6/action/citation_signature","submit_replication":"https://pith.science/pith/WF436HHCVQNJCXNLRGLE6LRZA6/action/replication_record"}},"created_at":"2026-07-05T11:18:02.456664+00:00","updated_at":"2026-07-05T11:18:02.456664+00:00"}