{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:4DMVC4VVKTAPRC4O7E5H6FTZHS","short_pith_number":"pith:4DMVC4VV","schema_version":"1.0","canonical_sha256":"e0d95172b554c0f88b8ef93a7f16793c99946c763305e9a85ba71b9e40d7fc89","source":{"kind":"arxiv","id":"1807.05041","version":1},"attestation_state":"computed","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)$ "},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1807.05041","created_at":"2026-05-18T00:10:49.175448+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.05041v1","created_at":"2026-05-18T00:10:49.175448+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.05041","created_at":"2026-05-18T00:10:49.175448+00:00"},{"alias_kind":"pith_short_12","alias_value":"4DMVC4VVKTAP","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_16","alias_value":"4DMVC4VVKTAPRC4O","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_8","alias_value":"4DMVC4VV","created_at":"2026-05-18T12:32:05.422762+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/4DMVC4VVKTAPRC4O7E5H6FTZHS","json":"https://pith.science/pith/4DMVC4VVKTAPRC4O7E5H6FTZHS.json","graph_json":"https://pith.science/api/pith-number/4DMVC4VVKTAPRC4O7E5H6FTZHS/graph.json","events_json":"https://pith.science/api/pith-number/4DMVC4VVKTAPRC4O7E5H6FTZHS/events.json","paper":"https://pith.science/paper/4DMVC4VV"},"agent_actions":{"view_html":"https://pith.science/pith/4DMVC4VVKTAPRC4O7E5H6FTZHS","download_json":"https://pith.science/pith/4DMVC4VVKTAPRC4O7E5H6FTZHS.json","view_paper":"https://pith.science/paper/4DMVC4VV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.05041&json=true","fetch_graph":"https://pith.science/api/pith-number/4DMVC4VVKTAPRC4O7E5H6FTZHS/graph.json","fetch_events":"https://pith.science/api/pith-number/4DMVC4VVKTAPRC4O7E5H6FTZHS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4DMVC4VVKTAPRC4O7E5H6FTZHS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4DMVC4VVKTAPRC4O7E5H6FTZHS/action/storage_attestation","attest_author":"https://pith.science/pith/4DMVC4VVKTAPRC4O7E5H6FTZHS/action/author_attestation","sign_citation":"https://pith.science/pith/4DMVC4VVKTAPRC4O7E5H6FTZHS/action/citation_signature","submit_replication":"https://pith.science/pith/4DMVC4VVKTAPRC4O7E5H6FTZHS/action/replication_record"}},"created_at":"2026-05-18T00:10:49.175448+00:00","updated_at":"2026-05-18T00:10:49.175448+00:00"}