{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:VV4VGQZWLJ2NPEGXJUWEKKM2ET","short_pith_number":"pith:VV4VGQZW","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"},"canonical_sha256":"ad795343365a74d790d74d2c45299a24cb395fe2dd684b17d672ad41498fa1ca","source":{"kind":"arxiv","id":"1110.3490","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.3490","created_at":"2026-05-18T03:31:32Z"},{"alias_kind":"arxiv_version","alias_value":"1110.3490v2","created_at":"2026-05-18T03:31:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.3490","created_at":"2026-05-18T03:31:32Z"},{"alias_kind":"pith_short_12","alias_value":"VV4VGQZWLJ2N","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"VV4VGQZWLJ2NPEGX","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"VV4VGQZW","created_at":"2026-05-18T12:26:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:VV4VGQZWLJ2NPEGXJUWEKKM2ET","target":"record","payload":{"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"},"canonical_sha256":"ad795343365a74d790d74d2c45299a24cb395fe2dd684b17d672ad41498fa1ca","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"},"source_kind":"arxiv","source_id":"1110.3490","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-05-18T03:31:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gq2H0wRZ7P+duw15tmBGUcoG17HVFBWZGv3X+pHG+QLwUKAsi2j68oK5VQVidBXdrEEdlyTlwTG+KDLU/Pv8Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T10:53:50.229840Z"},"content_sha256":"0033cf58b27a75deafcdfa07f5e661a42b2a5aff53ebee0dd4a6e951e660e994","schema_version":"1.0","event_id":"sha256:0033cf58b27a75deafcdfa07f5e661a42b2a5aff53ebee0dd4a6e951e660e994"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:VV4VGQZWLJ2NPEGXJUWEKKM2ET","target":"graph","payload":{"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"},"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-05-18T03:31:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Gwbb14v6jGrkyXv09657V/IshGZwYnUQ7UN+rhHZUcd7hknlqFLoDRWxEC/5wQVa8vMcRFvSMONyrVYVEU/7DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T10:53:50.230210Z"},"content_sha256":"8c126371b4ac25a49e7e5868275571f90e71f23186308f0fb6d81bc40c0030fa","schema_version":"1.0","event_id":"sha256:8c126371b4ac25a49e7e5868275571f90e71f23186308f0fb6d81bc40c0030fa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VV4VGQZWLJ2NPEGXJUWEKKM2ET/bundle.json","state_url":"https://pith.science/pith/VV4VGQZWLJ2NPEGXJUWEKKM2ET/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VV4VGQZWLJ2NPEGXJUWEKKM2ET/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-11T10:53:50Z","links":{"resolver":"https://pith.science/pith/VV4VGQZWLJ2NPEGXJUWEKKM2ET","bundle":"https://pith.science/pith/VV4VGQZWLJ2NPEGXJUWEKKM2ET/bundle.json","state":"https://pith.science/pith/VV4VGQZWLJ2NPEGXJUWEKKM2ET/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VV4VGQZWLJ2NPEGXJUWEKKM2ET/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:VV4VGQZWLJ2NPEGXJUWEKKM2ET","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":"80bfc78b38cd9eecf09ba6e49f7d1a8392cf35c7d4da500ca6d6314cb69252b0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-10-16T14:50:44Z","title_canon_sha256":"e8ee879981ff4f1220cfd8acb50dd9ee85610c267599a795dcf451a8977d3381"},"schema_version":"1.0","source":{"id":"1110.3490","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.3490","created_at":"2026-05-18T03:31:32Z"},{"alias_kind":"arxiv_version","alias_value":"1110.3490v2","created_at":"2026-05-18T03:31:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.3490","created_at":"2026-05-18T03:31:32Z"},{"alias_kind":"pith_short_12","alias_value":"VV4VGQZWLJ2N","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"VV4VGQZWLJ2NPEGX","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"VV4VGQZW","created_at":"2026-05-18T12:26:44Z"}],"graph_snapshots":[{"event_id":"sha256:8c126371b4ac25a49e7e5868275571f90e71f23186308f0fb6d81bc40c0030fa","target":"graph","created_at":"2026-05-18T03:31: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"},"paper":{"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","authors_text":"Alexandr V. Kostochka, Andrew Treglown, J\\'ozsef Balogh","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-10-16T14:50:44Z","title":"On perfect packings in dense graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.3490","kind":"arxiv","version":2},"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:0033cf58b27a75deafcdfa07f5e661a42b2a5aff53ebee0dd4a6e951e660e994","target":"record","created_at":"2026-05-18T03:31: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":"80bfc78b38cd9eecf09ba6e49f7d1a8392cf35c7d4da500ca6d6314cb69252b0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-10-16T14:50:44Z","title_canon_sha256":"e8ee879981ff4f1220cfd8acb50dd9ee85610c267599a795dcf451a8977d3381"},"schema_version":"1.0","source":{"id":"1110.3490","kind":"arxiv","version":2}},"canonical_sha256":"ad795343365a74d790d74d2c45299a24cb395fe2dd684b17d672ad41498fa1ca","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ad795343365a74d790d74d2c45299a24cb395fe2dd684b17d672ad41498fa1ca","first_computed_at":"2026-05-18T03:31:32.921727Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:31:32.921727Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"g/iVgV772FSHSVY4GHTByqRJtL0zBDy00msjfZqwPLrIVHALuEcNjZ6AecWCljI4DuYU3rBghb/oRbrf7wmLCw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:31:32.922458Z","signed_message":"canonical_sha256_bytes"},"source_id":"1110.3490","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0033cf58b27a75deafcdfa07f5e661a42b2a5aff53ebee0dd4a6e951e660e994","sha256:8c126371b4ac25a49e7e5868275571f90e71f23186308f0fb6d81bc40c0030fa"],"state_sha256":"0de8f27d3606c13a63dc3ea157b2ca0897841cf7dce1357c8f092923833b76dd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tyVJZXUSQUYRhWDjLADDMClO8/cKo+b0vFQvMYVx2UZi1OJ3+J+4ZMlfWwMdHHtFMxwmKyyVFe5nYqQuK5noDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T10:53:50.232222Z","bundle_sha256":"a25613c37f2a95e80cf30e9be4da8c6f49643d0ef1c677e4606190ebea974ce3"}}