{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:MWFNJKOORU2YRDB2NMLMSYMQSC","short_pith_number":"pith:MWFNJKOO","schema_version":"1.0","canonical_sha256":"658ad4a9ce8d35888c3a6b16c9619090a2b186d7f29c61d67a6a9c32a95fd04e","source":{"kind":"arxiv","id":"1608.06961","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1608.06961","created_at":"2026-05-18T01:07:56.405893+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.06961v1","created_at":"2026-05-18T01:07:56.405893+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.06961","created_at":"2026-05-18T01:07:56.405893+00:00"},{"alias_kind":"pith_short_12","alias_value":"MWFNJKOORU2Y","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_16","alias_value":"MWFNJKOORU2YRDB2","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_8","alias_value":"MWFNJKOO","created_at":"2026-05-18T12:30:32.724797+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/MWFNJKOORU2YRDB2NMLMSYMQSC","json":"https://pith.science/pith/MWFNJKOORU2YRDB2NMLMSYMQSC.json","graph_json":"https://pith.science/api/pith-number/MWFNJKOORU2YRDB2NMLMSYMQSC/graph.json","events_json":"https://pith.science/api/pith-number/MWFNJKOORU2YRDB2NMLMSYMQSC/events.json","paper":"https://pith.science/paper/MWFNJKOO"},"agent_actions":{"view_html":"https://pith.science/pith/MWFNJKOORU2YRDB2NMLMSYMQSC","download_json":"https://pith.science/pith/MWFNJKOORU2YRDB2NMLMSYMQSC.json","view_paper":"https://pith.science/paper/MWFNJKOO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.06961&json=true","fetch_graph":"https://pith.science/api/pith-number/MWFNJKOORU2YRDB2NMLMSYMQSC/graph.json","fetch_events":"https://pith.science/api/pith-number/MWFNJKOORU2YRDB2NMLMSYMQSC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MWFNJKOORU2YRDB2NMLMSYMQSC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MWFNJKOORU2YRDB2NMLMSYMQSC/action/storage_attestation","attest_author":"https://pith.science/pith/MWFNJKOORU2YRDB2NMLMSYMQSC/action/author_attestation","sign_citation":"https://pith.science/pith/MWFNJKOORU2YRDB2NMLMSYMQSC/action/citation_signature","submit_replication":"https://pith.science/pith/MWFNJKOORU2YRDB2NMLMSYMQSC/action/replication_record"}},"created_at":"2026-05-18T01:07:56.405893+00:00","updated_at":"2026-05-18T01:07:56.405893+00:00"}