{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:QBLYPCCNF72224FSI4JNKBV4A7","short_pith_number":"pith:QBLYPCCN","canonical_record":{"source":{"id":"1206.1376","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-06-07T00:25:27Z","cross_cats_sorted":[],"title_canon_sha256":"f719ea97afb93f2c9ffd9b57fda7bef6eb181110315ca98ad46996e7badf850a","abstract_canon_sha256":"a1267eb2b2292f2041111439aa305f123522116707722e5d971a5dbec4b8ed68"},"schema_version":"1.0"},"canonical_sha256":"805787884d2ff5ad70b24712d506bc07e1bec79c84e1e0827945ead917bfd7d2","source":{"kind":"arxiv","id":"1206.1376","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.1376","created_at":"2026-05-18T03:27:12Z"},{"alias_kind":"arxiv_version","alias_value":"1206.1376v2","created_at":"2026-05-18T03:27:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.1376","created_at":"2026-05-18T03:27:12Z"},{"alias_kind":"pith_short_12","alias_value":"QBLYPCCNF722","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"QBLYPCCNF72224FS","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"QBLYPCCN","created_at":"2026-05-18T12:27:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:QBLYPCCNF72224FSI4JNKBV4A7","target":"record","payload":{"canonical_record":{"source":{"id":"1206.1376","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-06-07T00:25:27Z","cross_cats_sorted":[],"title_canon_sha256":"f719ea97afb93f2c9ffd9b57fda7bef6eb181110315ca98ad46996e7badf850a","abstract_canon_sha256":"a1267eb2b2292f2041111439aa305f123522116707722e5d971a5dbec4b8ed68"},"schema_version":"1.0"},"canonical_sha256":"805787884d2ff5ad70b24712d506bc07e1bec79c84e1e0827945ead917bfd7d2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:27:12.189737Z","signature_b64":"7eraajGWGlIKmwuQCYY9Ox/Y0vPQmWxvhVpplljHQAFB95dhbWL8WIJr19sJCKjqFJ3wOpUbDlA4xCioIe28AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"805787884d2ff5ad70b24712d506bc07e1bec79c84e1e0827945ead917bfd7d2","last_reissued_at":"2026-05-18T03:27:12.188904Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:27:12.188904Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1206.1376","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:27:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cCFWjT8TEirqOudZ3iDfu3O3lERwi8bWhO3y5KqMV3Qljz6tRojriaJg9ECwOSf6vSAQQ1uePnwCNkKsZIK1Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T14:27:14.610188Z"},"content_sha256":"00373970a74d0dc9193b8c67b628fbfa9b6f8914b5669d2ac7676a630bbef71f","schema_version":"1.0","event_id":"sha256:00373970a74d0dc9193b8c67b628fbfa9b6f8914b5669d2ac7676a630bbef71f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:QBLYPCCNF72224FSI4JNKBV4A7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Towards a weighted version of the Hajnal-Szemer\\'edi Theorem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Choongbum Lee, Graeme Kemkes, J\\'ozsef Balogh, Stephen J. Young","submitted_at":"2012-06-07T00:25:27Z","abstract_excerpt":"For a positive integer r>=2, a K_r-factor of a graph is a collection vertex-disjoint copies of K_r which covers all the vertices of the given graph. The celebrated theorem of Hajnal and Szemer\\'edi asserts that every graph on n vertices with minimum degree at least (1-1/r)n contains a K_r-factor. In this note, we propose investigating the relation between minimum degree and existence of perfect K_r-packing for edge-weighted graphs. The main question we study is the following. Suppose that a positive integer r>=2 and a real t in [0,1] is given. What is the minimum weighted degree of K_n that gu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.1376","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:27:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ADFkcGnK0J4VyyWf8xqkL0GiwBn9onhKJZBqaBIJaCVju13h/SCZqEDuIvCeDGkor5f94tw6w/E26pMx90i6AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T14:27:14.610549Z"},"content_sha256":"e4726987347a798fe88cbffb021a683184694351f6a6bdb22b5b589eef79806c","schema_version":"1.0","event_id":"sha256:e4726987347a798fe88cbffb021a683184694351f6a6bdb22b5b589eef79806c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QBLYPCCNF72224FSI4JNKBV4A7/bundle.json","state_url":"https://pith.science/pith/QBLYPCCNF72224FSI4JNKBV4A7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QBLYPCCNF72224FSI4JNKBV4A7/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-01T14:27:14Z","links":{"resolver":"https://pith.science/pith/QBLYPCCNF72224FSI4JNKBV4A7","bundle":"https://pith.science/pith/QBLYPCCNF72224FSI4JNKBV4A7/bundle.json","state":"https://pith.science/pith/QBLYPCCNF72224FSI4JNKBV4A7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QBLYPCCNF72224FSI4JNKBV4A7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:QBLYPCCNF72224FSI4JNKBV4A7","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":"a1267eb2b2292f2041111439aa305f123522116707722e5d971a5dbec4b8ed68","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-06-07T00:25:27Z","title_canon_sha256":"f719ea97afb93f2c9ffd9b57fda7bef6eb181110315ca98ad46996e7badf850a"},"schema_version":"1.0","source":{"id":"1206.1376","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.1376","created_at":"2026-05-18T03:27:12Z"},{"alias_kind":"arxiv_version","alias_value":"1206.1376v2","created_at":"2026-05-18T03:27:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.1376","created_at":"2026-05-18T03:27:12Z"},{"alias_kind":"pith_short_12","alias_value":"QBLYPCCNF722","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"QBLYPCCNF72224FS","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"QBLYPCCN","created_at":"2026-05-18T12:27:18Z"}],"graph_snapshots":[{"event_id":"sha256:e4726987347a798fe88cbffb021a683184694351f6a6bdb22b5b589eef79806c","target":"graph","created_at":"2026-05-18T03:27:12Z","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":"For a positive integer r>=2, a K_r-factor of a graph is a collection vertex-disjoint copies of K_r which covers all the vertices of the given graph. The celebrated theorem of Hajnal and Szemer\\'edi asserts that every graph on n vertices with minimum degree at least (1-1/r)n contains a K_r-factor. In this note, we propose investigating the relation between minimum degree and existence of perfect K_r-packing for edge-weighted graphs. The main question we study is the following. Suppose that a positive integer r>=2 and a real t in [0,1] is given. What is the minimum weighted degree of K_n that gu","authors_text":"Choongbum Lee, Graeme Kemkes, J\\'ozsef Balogh, Stephen J. Young","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-06-07T00:25:27Z","title":"Towards a weighted version of the Hajnal-Szemer\\'edi Theorem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.1376","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:00373970a74d0dc9193b8c67b628fbfa9b6f8914b5669d2ac7676a630bbef71f","target":"record","created_at":"2026-05-18T03:27:12Z","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":"a1267eb2b2292f2041111439aa305f123522116707722e5d971a5dbec4b8ed68","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-06-07T00:25:27Z","title_canon_sha256":"f719ea97afb93f2c9ffd9b57fda7bef6eb181110315ca98ad46996e7badf850a"},"schema_version":"1.0","source":{"id":"1206.1376","kind":"arxiv","version":2}},"canonical_sha256":"805787884d2ff5ad70b24712d506bc07e1bec79c84e1e0827945ead917bfd7d2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"805787884d2ff5ad70b24712d506bc07e1bec79c84e1e0827945ead917bfd7d2","first_computed_at":"2026-05-18T03:27:12.188904Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:27:12.188904Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7eraajGWGlIKmwuQCYY9Ox/Y0vPQmWxvhVpplljHQAFB95dhbWL8WIJr19sJCKjqFJ3wOpUbDlA4xCioIe28AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:27:12.189737Z","signed_message":"canonical_sha256_bytes"},"source_id":"1206.1376","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:00373970a74d0dc9193b8c67b628fbfa9b6f8914b5669d2ac7676a630bbef71f","sha256:e4726987347a798fe88cbffb021a683184694351f6a6bdb22b5b589eef79806c"],"state_sha256":"285bb0c1acf0d43c03ba3a7e1bc919c44a2e848fa394defb8a9d3fb8e54968b5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QKY52dcZfQ3AMsSYiBvW1j3BsBeGZQmk7sJu7I0PXI7l34q3ifS7Nn5M37KUYOCKZurn1eLHcYEvQUaAIDwtBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T14:27:14.612508Z","bundle_sha256":"6a7ff5cc3070ed18435bd59f775aeff1454271e5b2d4c3cb1b856d58f74a99f8"}}