{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:MWFNJKOORU2YRDB2NMLMSYMQSC","short_pith_number":"pith:MWFNJKOO","canonical_record":{"source":{"id":"1608.06961","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-08-24T20:29:32Z","cross_cats_sorted":[],"title_canon_sha256":"0670ade76d7f8a3a8003ad1195aecffd223ccfbbc16e870a238b7b3657227032","abstract_canon_sha256":"5d286a4ee67d2c614c97278eb39b515e4145c31c131b0fc5226e1f019611d78b"},"schema_version":"1.0"},"canonical_sha256":"658ad4a9ce8d35888c3a6b16c9619090a2b186d7f29c61d67a6a9c32a95fd04e","source":{"kind":"arxiv","id":"1608.06961","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:MWFNJKOORU2YRDB2NMLMSYMQSC","target":"record","payload":{"canonical_record":{"source":{"id":"1608.06961","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-08-24T20:29:32Z","cross_cats_sorted":[],"title_canon_sha256":"0670ade76d7f8a3a8003ad1195aecffd223ccfbbc16e870a238b7b3657227032","abstract_canon_sha256":"5d286a4ee67d2c614c97278eb39b515e4145c31c131b0fc5226e1f019611d78b"},"schema_version":"1.0"},"canonical_sha256":"658ad4a9ce8d35888c3a6b16c9619090a2b186d7f29c61d67a6a9c32a95fd04e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:07:56.406453Z","signature_b64":"V5QQXTn7KQIBtrgTUL6kV06bVRtxy0W8PamsX5ysQU7EFeihqJ+u1JJtB1Qy3shqvTzjRmhpnONQKZ2lIPVaBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"658ad4a9ce8d35888c3a6b16c9619090a2b186d7f29c61d67a6a9c32a95fd04e","last_reissued_at":"2026-05-18T01:07:56.405808Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:07:56.405808Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1608.06961","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-18T01:07:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KJ4NdVdmH0NQ/1idckOiXTnZbWFklZVjzMsyiYBNK45y2fY5jBcJ8dzzfOm3HOQq+s9zjbtPlmC9cA1E/qxnDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T17:10:20.669585Z"},"content_sha256":"1db8888b87af182efd84ab2718dd07f681207a8c700a8d0e9e1456a87c55add6","schema_version":"1.0","event_id":"sha256:1db8888b87af182efd84ab2718dd07f681207a8c700a8d0e9e1456a87c55add6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:MWFNJKOORU2YRDB2NMLMSYMQSC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Enclosings of Decompositions of Complete Multigraphs in 2-Factorizations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Carl Feghali, Matthew Johnson","submitted_at":"2016-08-24T20:29:32Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.06961","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-18T01:07:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EXcbO0KElnFqSCTaoDXUfEHb1aYIEziNQR3uVpMcOBX6dUiDI5bQ6DmevfP4ImU+/J4sIn8oPX1mTFm30WcUAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T17:10:20.670291Z"},"content_sha256":"08761595c55146857506a490d15d9f8a79b1d8b379c90bc00dce4c7713a0cd52","schema_version":"1.0","event_id":"sha256:08761595c55146857506a490d15d9f8a79b1d8b379c90bc00dce4c7713a0cd52"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MWFNJKOORU2YRDB2NMLMSYMQSC/bundle.json","state_url":"https://pith.science/pith/MWFNJKOORU2YRDB2NMLMSYMQSC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MWFNJKOORU2YRDB2NMLMSYMQSC/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-25T17:10:20Z","links":{"resolver":"https://pith.science/pith/MWFNJKOORU2YRDB2NMLMSYMQSC","bundle":"https://pith.science/pith/MWFNJKOORU2YRDB2NMLMSYMQSC/bundle.json","state":"https://pith.science/pith/MWFNJKOORU2YRDB2NMLMSYMQSC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MWFNJKOORU2YRDB2NMLMSYMQSC/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"253Gz7STDVeUzZ5cdJp8svEonRYi3jVx8ZFIg9DJ8NUt7m0LBlsTIkThgslW5a2swkij1D9KL5UHMvOdPZKNCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T17:10:20.674005Z","bundle_sha256":"f628d61c93b3143ca6e86d47e0244551d54728dc312bac2e5bd233d5099dca00"}}