{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:FZXEU6CVGAQCOGQ7TQCR5KZJJL","short_pith_number":"pith:FZXEU6CV","schema_version":"1.0","canonical_sha256":"2e6e4a78553020271a1f9c051eab294ac0e1e4dacb437e49a7c8c9e96b22fd31","source":{"kind":"arxiv","id":"1810.12340","version":2},"attestation_state":"computed","paper":{"title":"Enclosings of Decompositions of Complete Multigraphs in $2$-Edge-Connected $r$-Factorizations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Carl Feghali, John Asplund, Pierre Charbit","submitted_at":"2018-10-29T18:38:41Z","abstract_excerpt":"A decomposition of a multigraph $G$ is a partition of its edges into subgraphs $G(1), \\ldots , G(k)$. It is called an $r$-factorization if every $G(i)$ is $r$-regular and spanning. If $G$ is a subgraph of $H$, a decomposition of $G$ is said to be enclosed in a decomposition of $H$ if, for every $1 \\leq i \\leq k$, $G(i)$ is a subgraph of $H(i)$.\n  Feghali and Johnson gave necessary and sufficient conditions for a given decomposition of $\\lambda K_n$ to be enclosed in some $2$-edge-connected $r$-factorization of $\\mu K_{m}$ for some range of values for the parameters $n$, $m$, $\\lambda$, $\\mu$, "},"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":"1810.12340","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-29T18:38:41Z","cross_cats_sorted":[],"title_canon_sha256":"8af7b644ab15abb066e1558eab839acff4874e1a50af6887eebd4dd599ace537","abstract_canon_sha256":"1db34f87330a526693d2cb2eae5225aaa7bb263b995bcf78262b6b661044f5f9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:40.033292Z","signature_b64":"SlCXvoL2OUYtfUj2Hm9tXd65IBmnUnQLBEb73haQlV08s0N9uPowvbu6jMxatD5kFDCuzyPLQH7vOM5+DLGNBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2e6e4a78553020271a1f9c051eab294ac0e1e4dacb437e49a7c8c9e96b22fd31","last_reissued_at":"2026-05-17T23:48:40.032606Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:40.032606Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Enclosings of Decompositions of Complete Multigraphs in $2$-Edge-Connected $r$-Factorizations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Carl Feghali, John Asplund, Pierre Charbit","submitted_at":"2018-10-29T18:38:41Z","abstract_excerpt":"A decomposition of a multigraph $G$ is a partition of its edges into subgraphs $G(1), \\ldots , G(k)$. It is called an $r$-factorization if every $G(i)$ is $r$-regular and spanning. If $G$ is a subgraph of $H$, a decomposition of $G$ is said to be enclosed in a decomposition of $H$ if, for every $1 \\leq i \\leq k$, $G(i)$ is a subgraph of $H(i)$.\n  Feghali and Johnson gave necessary and sufficient conditions for a given decomposition of $\\lambda K_n$ to be enclosed in some $2$-edge-connected $r$-factorization of $\\mu K_{m}$ for some range of values for the parameters $n$, $m$, $\\lambda$, $\\mu$, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.12340","kind":"arxiv","version":2},"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":"1810.12340","created_at":"2026-05-17T23:48:40.032722+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.12340v2","created_at":"2026-05-17T23:48:40.032722+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.12340","created_at":"2026-05-17T23:48:40.032722+00:00"},{"alias_kind":"pith_short_12","alias_value":"FZXEU6CVGAQC","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_16","alias_value":"FZXEU6CVGAQCOGQ7","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_8","alias_value":"FZXEU6CV","created_at":"2026-05-18T12:32:25.280505+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/FZXEU6CVGAQCOGQ7TQCR5KZJJL","json":"https://pith.science/pith/FZXEU6CVGAQCOGQ7TQCR5KZJJL.json","graph_json":"https://pith.science/api/pith-number/FZXEU6CVGAQCOGQ7TQCR5KZJJL/graph.json","events_json":"https://pith.science/api/pith-number/FZXEU6CVGAQCOGQ7TQCR5KZJJL/events.json","paper":"https://pith.science/paper/FZXEU6CV"},"agent_actions":{"view_html":"https://pith.science/pith/FZXEU6CVGAQCOGQ7TQCR5KZJJL","download_json":"https://pith.science/pith/FZXEU6CVGAQCOGQ7TQCR5KZJJL.json","view_paper":"https://pith.science/paper/FZXEU6CV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.12340&json=true","fetch_graph":"https://pith.science/api/pith-number/FZXEU6CVGAQCOGQ7TQCR5KZJJL/graph.json","fetch_events":"https://pith.science/api/pith-number/FZXEU6CVGAQCOGQ7TQCR5KZJJL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FZXEU6CVGAQCOGQ7TQCR5KZJJL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FZXEU6CVGAQCOGQ7TQCR5KZJJL/action/storage_attestation","attest_author":"https://pith.science/pith/FZXEU6CVGAQCOGQ7TQCR5KZJJL/action/author_attestation","sign_citation":"https://pith.science/pith/FZXEU6CVGAQCOGQ7TQCR5KZJJL/action/citation_signature","submit_replication":"https://pith.science/pith/FZXEU6CVGAQCOGQ7TQCR5KZJJL/action/replication_record"}},"created_at":"2026-05-17T23:48:40.032722+00:00","updated_at":"2026-05-17T23:48:40.032722+00:00"}