{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:4DMVC4VVKTAPRC4O7E5H6FTZHS","short_pith_number":"pith:4DMVC4VV","canonical_record":{"source":{"id":"1807.05041","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-13T12:43:48Z","cross_cats_sorted":[],"title_canon_sha256":"70c69af79ebdc0b9823facf46964ccb002a491b9ebd6d9b7f0d845cf9912d8f2","abstract_canon_sha256":"6c369d6cca22a748dd57a7abdab101bab7bff73c6c4f95527bf7b1ecbfc31c39"},"schema_version":"1.0"},"canonical_sha256":"e0d95172b554c0f88b8ef93a7f16793c99946c763305e9a85ba71b9e40d7fc89","source":{"kind":"arxiv","id":"1807.05041","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.05041","created_at":"2026-05-18T00:10:49Z"},{"alias_kind":"arxiv_version","alias_value":"1807.05041v1","created_at":"2026-05-18T00:10:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.05041","created_at":"2026-05-18T00:10:49Z"},{"alias_kind":"pith_short_12","alias_value":"4DMVC4VVKTAP","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"4DMVC4VVKTAPRC4O","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"4DMVC4VV","created_at":"2026-05-18T12:32:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:4DMVC4VVKTAPRC4O7E5H6FTZHS","target":"record","payload":{"canonical_record":{"source":{"id":"1807.05041","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-13T12:43:48Z","cross_cats_sorted":[],"title_canon_sha256":"70c69af79ebdc0b9823facf46964ccb002a491b9ebd6d9b7f0d845cf9912d8f2","abstract_canon_sha256":"6c369d6cca22a748dd57a7abdab101bab7bff73c6c4f95527bf7b1ecbfc31c39"},"schema_version":"1.0"},"canonical_sha256":"e0d95172b554c0f88b8ef93a7f16793c99946c763305e9a85ba71b9e40d7fc89","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:49.176026Z","signature_b64":"dgt2epCXB4W4L3W03VSwgdOH52baXsSeeoc7YyrYMiApu+S2PlnHJQeJy6iHmdsRmh3WfUTOO+TM+UEGlHgeDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e0d95172b554c0f88b8ef93a7f16793c99946c763305e9a85ba71b9e40d7fc89","last_reissued_at":"2026-05-18T00:10:49.175332Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:49.175332Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.05041","source_version":1,"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-18T00:10:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NfMlBfzAznBQJUp26f8Pp/tU1mZl6u2+XTMg8VloogVzQe2CfQ+phiKnERAN44VISx3wnamnKdCK8NQlNJ/wCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-18T19:09:22.245342Z"},"content_sha256":"67b9c355cd72ec4d8f4254f55f704797877b7af63ff4ec84017e25a5e0e77960","schema_version":"1.0","event_id":"sha256:67b9c355cd72ec4d8f4254f55f704797877b7af63ff4ec84017e25a5e0e77960"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:4DMVC4VVKTAPRC4O7E5H6FTZHS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Clumsy packings of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Anika Kaufmann, Maria Axenovich, Raphael Yuster","submitted_at":"2018-07-13T12:43:48Z","abstract_excerpt":"Let $G$ and $H$ be graphs. We say that $P$ is an $H$-packing of $G$ if $P$ is a set of edge-disjoint copies of $H$ in $G$. An $H$-packing $P$ is maximal if there is no other $H$-packing of $G$ that properly contains $P$. Packings of maximum cardinality have been studied intensively, with several recent breakthrough results. Here, we consider minimum cardinality maximal packings. An $H$-packing $P$ is clumsy if it is maximal of minimum size. Let $cl(G,H)$ be the size of a clumsy $H$-packing of $G$. We provide nontrivial bounds for $cl(G,H)$, and in many cases asymptotically determine $cl(G,H)$ "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.05041","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":""},"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-18T00:10:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BrlRhauaO8vGXGL3dl28qV6M17YpCBmlHlvUYcB+m8cWe2ZKLmRgfnSVzJ0P0Rej6Ous6pPjqiHa+gSZBHSyCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-18T19:09:22.245983Z"},"content_sha256":"9086276bec79e0478dcc040ffbd17aee2cd94273647f8b3073f30914997c6e8f","schema_version":"1.0","event_id":"sha256:9086276bec79e0478dcc040ffbd17aee2cd94273647f8b3073f30914997c6e8f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4DMVC4VVKTAPRC4O7E5H6FTZHS/bundle.json","state_url":"https://pith.science/pith/4DMVC4VVKTAPRC4O7E5H6FTZHS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4DMVC4VVKTAPRC4O7E5H6FTZHS/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-05-18T19:09:22Z","links":{"resolver":"https://pith.science/pith/4DMVC4VVKTAPRC4O7E5H6FTZHS","bundle":"https://pith.science/pith/4DMVC4VVKTAPRC4O7E5H6FTZHS/bundle.json","state":"https://pith.science/pith/4DMVC4VVKTAPRC4O7E5H6FTZHS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4DMVC4VVKTAPRC4O7E5H6FTZHS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:4DMVC4VVKTAPRC4O7E5H6FTZHS","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":"6c369d6cca22a748dd57a7abdab101bab7bff73c6c4f95527bf7b1ecbfc31c39","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-13T12:43:48Z","title_canon_sha256":"70c69af79ebdc0b9823facf46964ccb002a491b9ebd6d9b7f0d845cf9912d8f2"},"schema_version":"1.0","source":{"id":"1807.05041","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.05041","created_at":"2026-05-18T00:10:49Z"},{"alias_kind":"arxiv_version","alias_value":"1807.05041v1","created_at":"2026-05-18T00:10:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.05041","created_at":"2026-05-18T00:10:49Z"},{"alias_kind":"pith_short_12","alias_value":"4DMVC4VVKTAP","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"4DMVC4VVKTAPRC4O","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"4DMVC4VV","created_at":"2026-05-18T12:32:05Z"}],"graph_snapshots":[{"event_id":"sha256:9086276bec79e0478dcc040ffbd17aee2cd94273647f8b3073f30914997c6e8f","target":"graph","created_at":"2026-05-18T00:10:49Z","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":"Let $G$ and $H$ be graphs. We say that $P$ is an $H$-packing of $G$ if $P$ is a set of edge-disjoint copies of $H$ in $G$. An $H$-packing $P$ is maximal if there is no other $H$-packing of $G$ that properly contains $P$. Packings of maximum cardinality have been studied intensively, with several recent breakthrough results. Here, we consider minimum cardinality maximal packings. An $H$-packing $P$ is clumsy if it is maximal of minimum size. Let $cl(G,H)$ be the size of a clumsy $H$-packing of $G$. We provide nontrivial bounds for $cl(G,H)$, and in many cases asymptotically determine $cl(G,H)$ ","authors_text":"Anika Kaufmann, Maria Axenovich, Raphael Yuster","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-13T12:43:48Z","title":"Clumsy packings of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.05041","kind":"arxiv","version":1},"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:67b9c355cd72ec4d8f4254f55f704797877b7af63ff4ec84017e25a5e0e77960","target":"record","created_at":"2026-05-18T00:10:49Z","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":"6c369d6cca22a748dd57a7abdab101bab7bff73c6c4f95527bf7b1ecbfc31c39","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-13T12:43:48Z","title_canon_sha256":"70c69af79ebdc0b9823facf46964ccb002a491b9ebd6d9b7f0d845cf9912d8f2"},"schema_version":"1.0","source":{"id":"1807.05041","kind":"arxiv","version":1}},"canonical_sha256":"e0d95172b554c0f88b8ef93a7f16793c99946c763305e9a85ba71b9e40d7fc89","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e0d95172b554c0f88b8ef93a7f16793c99946c763305e9a85ba71b9e40d7fc89","first_computed_at":"2026-05-18T00:10:49.175332Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:10:49.175332Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dgt2epCXB4W4L3W03VSwgdOH52baXsSeeoc7YyrYMiApu+S2PlnHJQeJy6iHmdsRmh3WfUTOO+TM+UEGlHgeDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:10:49.176026Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.05041","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:67b9c355cd72ec4d8f4254f55f704797877b7af63ff4ec84017e25a5e0e77960","sha256:9086276bec79e0478dcc040ffbd17aee2cd94273647f8b3073f30914997c6e8f"],"state_sha256":"9cb78b8f8aa587ce6f7b410cad5d40650ca540e421f3a7b8e3ed0ef97ee78390"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H1A6egOoXOelRQyt2b+BMQ8Sfi3Dn+qawsZdB9D0Elum4cOJH7aq72bQYavZHDEJkKLXmOD7H1isv0Nf1Y8jBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-18T19:09:22.248127Z","bundle_sha256":"0b4290f6bf8562f2bb471c9e651e53d944304fa6ca7d72483f49403a8f54ac62"}}