{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:MWFNJKOORU2YRDB2NMLMSYMQSC","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":"5d286a4ee67d2c614c97278eb39b515e4145c31c131b0fc5226e1f019611d78b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-08-24T20:29:32Z","title_canon_sha256":"0670ade76d7f8a3a8003ad1195aecffd223ccfbbc16e870a238b7b3657227032"},"schema_version":"1.0","source":{"id":"1608.06961","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.06961","created_at":"2026-05-18T01:07:56Z"},{"alias_kind":"arxiv_version","alias_value":"1608.06961v1","created_at":"2026-05-18T01:07:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.06961","created_at":"2026-05-18T01:07:56Z"},{"alias_kind":"pith_short_12","alias_value":"MWFNJKOORU2Y","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"MWFNJKOORU2YRDB2","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"MWFNJKOO","created_at":"2026-05-18T12:30:32Z"}],"graph_snapshots":[{"event_id":"sha256:08761595c55146857506a490d15d9f8a79b1d8b379c90bc00dce4c7713a0cd52","target":"graph","created_at":"2026-05-18T01:07:56Z","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 $k$, $\\lambda$ and $\\mu$ be positive integers. A decomposition of a multigraph $ \\lambda G$ into edge-disjoint subgraphs $G_1, \\ldots , G_k$ is said to be \\emph{enclosed} by a decomposition of a multigraph $\\mu H$ into edge-disjoint subgraphs $H_1, \\ldots , H_k$ if $\\mu > \\lambda$ and $G_i$ is a subgraph of $H_i$, $1 \\leq i \\leq k$. In this paper we initiate the study of when a decomposition can be enclosed by a decomposition that consists of spanning subgraphs.\n  A decomposition of a graph is a 2-factorization if each subgraph is 2-regular and is Hamiltonian if each subgraph is a Hamilton","authors_text":"Carl Feghali, Matthew Johnson","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-08-24T20:29:32Z","title":"Enclosings of Decompositions of Complete Multigraphs in 2-Factorizations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.06961","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:1db8888b87af182efd84ab2718dd07f681207a8c700a8d0e9e1456a87c55add6","target":"record","created_at":"2026-05-18T01:07:56Z","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":"5d286a4ee67d2c614c97278eb39b515e4145c31c131b0fc5226e1f019611d78b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-08-24T20:29:32Z","title_canon_sha256":"0670ade76d7f8a3a8003ad1195aecffd223ccfbbc16e870a238b7b3657227032"},"schema_version":"1.0","source":{"id":"1608.06961","kind":"arxiv","version":1}},"canonical_sha256":"658ad4a9ce8d35888c3a6b16c9619090a2b186d7f29c61d67a6a9c32a95fd04e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"658ad4a9ce8d35888c3a6b16c9619090a2b186d7f29c61d67a6a9c32a95fd04e","first_computed_at":"2026-05-18T01:07:56.405808Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:07:56.405808Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"V5QQXTn7KQIBtrgTUL6kV06bVRtxy0W8PamsX5ysQU7EFeihqJ+u1JJtB1Qy3shqvTzjRmhpnONQKZ2lIPVaBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:07:56.406453Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.06961","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1db8888b87af182efd84ab2718dd07f681207a8c700a8d0e9e1456a87c55add6","sha256:08761595c55146857506a490d15d9f8a79b1d8b379c90bc00dce4c7713a0cd52"],"state_sha256":"88989ba6236aa10076c7b6972b728b9ac472621f5a82cc1b0cb20815a1216cfa"}