{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:VV4VGQZWLJ2NPEGXJUWEKKM2ET","short_pith_number":"pith:VV4VGQZW","schema_version":"1.0","canonical_sha256":"ad795343365a74d790d74d2c45299a24cb395fe2dd684b17d672ad41498fa1ca","source":{"kind":"arxiv","id":"1110.3490","version":2},"attestation_state":"computed","paper":{"title":"On perfect packings in dense graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexandr V. Kostochka, Andrew Treglown, J\\'ozsef Balogh","submitted_at":"2011-10-16T14:50:44Z","abstract_excerpt":"We say that a graph G has a perfect H-packing if there exists a set of vertex-disjoint copies of H which cover all the vertices in G. We consider various problems concerning perfect H-packings: Given positive integers n, r, D, we characterise the edge density threshold that ensures a perfect K_r-packing in any graph G on n vertices and with minimum degree at least D. We also give two conjectures concerning degree sequence conditions which force a graph to contain a perfect H-packing. Other related embedding problems are also considered. Indeed, we give a structural result concerning K_r-free g"},"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":"1110.3490","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-10-16T14:50:44Z","cross_cats_sorted":[],"title_canon_sha256":"e8ee879981ff4f1220cfd8acb50dd9ee85610c267599a795dcf451a8977d3381","abstract_canon_sha256":"80bfc78b38cd9eecf09ba6e49f7d1a8392cf35c7d4da500ca6d6314cb69252b0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:31:32.922458Z","signature_b64":"g/iVgV772FSHSVY4GHTByqRJtL0zBDy00msjfZqwPLrIVHALuEcNjZ6AecWCljI4DuYU3rBghb/oRbrf7wmLCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ad795343365a74d790d74d2c45299a24cb395fe2dd684b17d672ad41498fa1ca","last_reissued_at":"2026-05-18T03:31:32.921727Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:31:32.921727Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On perfect packings in dense graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexandr V. Kostochka, Andrew Treglown, J\\'ozsef Balogh","submitted_at":"2011-10-16T14:50:44Z","abstract_excerpt":"We say that a graph G has a perfect H-packing if there exists a set of vertex-disjoint copies of H which cover all the vertices in G. We consider various problems concerning perfect H-packings: Given positive integers n, r, D, we characterise the edge density threshold that ensures a perfect K_r-packing in any graph G on n vertices and with minimum degree at least D. We also give two conjectures concerning degree sequence conditions which force a graph to contain a perfect H-packing. Other related embedding problems are also considered. Indeed, we give a structural result concerning K_r-free g"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.3490","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1110.3490","created_at":"2026-05-18T03:31:32.921839+00:00"},{"alias_kind":"arxiv_version","alias_value":"1110.3490v2","created_at":"2026-05-18T03:31:32.921839+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.3490","created_at":"2026-05-18T03:31:32.921839+00:00"},{"alias_kind":"pith_short_12","alias_value":"VV4VGQZWLJ2N","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_16","alias_value":"VV4VGQZWLJ2NPEGX","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_8","alias_value":"VV4VGQZW","created_at":"2026-05-18T12:26:44.992195+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/VV4VGQZWLJ2NPEGXJUWEKKM2ET","json":"https://pith.science/pith/VV4VGQZWLJ2NPEGXJUWEKKM2ET.json","graph_json":"https://pith.science/api/pith-number/VV4VGQZWLJ2NPEGXJUWEKKM2ET/graph.json","events_json":"https://pith.science/api/pith-number/VV4VGQZWLJ2NPEGXJUWEKKM2ET/events.json","paper":"https://pith.science/paper/VV4VGQZW"},"agent_actions":{"view_html":"https://pith.science/pith/VV4VGQZWLJ2NPEGXJUWEKKM2ET","download_json":"https://pith.science/pith/VV4VGQZWLJ2NPEGXJUWEKKM2ET.json","view_paper":"https://pith.science/paper/VV4VGQZW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1110.3490&json=true","fetch_graph":"https://pith.science/api/pith-number/VV4VGQZWLJ2NPEGXJUWEKKM2ET/graph.json","fetch_events":"https://pith.science/api/pith-number/VV4VGQZWLJ2NPEGXJUWEKKM2ET/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VV4VGQZWLJ2NPEGXJUWEKKM2ET/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VV4VGQZWLJ2NPEGXJUWEKKM2ET/action/storage_attestation","attest_author":"https://pith.science/pith/VV4VGQZWLJ2NPEGXJUWEKKM2ET/action/author_attestation","sign_citation":"https://pith.science/pith/VV4VGQZWLJ2NPEGXJUWEKKM2ET/action/citation_signature","submit_replication":"https://pith.science/pith/VV4VGQZWLJ2NPEGXJUWEKKM2ET/action/replication_record"}},"created_at":"2026-05-18T03:31:32.921839+00:00","updated_at":"2026-05-18T03:31:32.921839+00:00"}