{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:FZXEU6CVGAQCOGQ7TQCR5KZJJL","short_pith_number":"pith:FZXEU6CV","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"},"canonical_sha256":"2e6e4a78553020271a1f9c051eab294ac0e1e4dacb437e49a7c8c9e96b22fd31","source":{"kind":"arxiv","id":"1810.12340","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.12340","created_at":"2026-05-17T23:48:40Z"},{"alias_kind":"arxiv_version","alias_value":"1810.12340v2","created_at":"2026-05-17T23:48:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.12340","created_at":"2026-05-17T23:48:40Z"},{"alias_kind":"pith_short_12","alias_value":"FZXEU6CVGAQC","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"FZXEU6CVGAQCOGQ7","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"FZXEU6CV","created_at":"2026-05-18T12:32:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:FZXEU6CVGAQCOGQ7TQCR5KZJJL","target":"record","payload":{"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"},"canonical_sha256":"2e6e4a78553020271a1f9c051eab294ac0e1e4dacb437e49a7c8c9e96b22fd31","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"},"source_kind":"arxiv","source_id":"1810.12340","source_version":2,"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-17T23:48:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rX41RkWwpp6PDothpUB56ABTMocMo6SnAFgntnoPv4eoIzx1APOOk4jCCAjUYkY1I1Q5yhZUBfrtUFA4BaxwBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:41:53.435428Z"},"content_sha256":"3d41d10c6da57d249e0b6723070bb2aef3adc4ac1d3bf5b66ee79a6aa476b548","schema_version":"1.0","event_id":"sha256:3d41d10c6da57d249e0b6723070bb2aef3adc4ac1d3bf5b66ee79a6aa476b548"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:FZXEU6CVGAQCOGQ7TQCR5KZJJL","target":"graph","payload":{"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"},"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-17T23:48:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9AgNgmhCtrs10y6Mil1qE7S5WcBuWwfh/KrzsYHxXM8CcgzzPxaigVeem8DM5iOFmgYf5SHvTpkZ53DEvb2NAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:41:53.436147Z"},"content_sha256":"b508bd6964d44a39600ab43632f402df0c3d15c774bbdf902401e7f51e738503","schema_version":"1.0","event_id":"sha256:b508bd6964d44a39600ab43632f402df0c3d15c774bbdf902401e7f51e738503"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FZXEU6CVGAQCOGQ7TQCR5KZJJL/bundle.json","state_url":"https://pith.science/pith/FZXEU6CVGAQCOGQ7TQCR5KZJJL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FZXEU6CVGAQCOGQ7TQCR5KZJJL/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-25T19:41:53Z","links":{"resolver":"https://pith.science/pith/FZXEU6CVGAQCOGQ7TQCR5KZJJL","bundle":"https://pith.science/pith/FZXEU6CVGAQCOGQ7TQCR5KZJJL/bundle.json","state":"https://pith.science/pith/FZXEU6CVGAQCOGQ7TQCR5KZJJL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FZXEU6CVGAQCOGQ7TQCR5KZJJL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:FZXEU6CVGAQCOGQ7TQCR5KZJJL","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":"1db34f87330a526693d2cb2eae5225aaa7bb263b995bcf78262b6b661044f5f9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-29T18:38:41Z","title_canon_sha256":"8af7b644ab15abb066e1558eab839acff4874e1a50af6887eebd4dd599ace537"},"schema_version":"1.0","source":{"id":"1810.12340","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.12340","created_at":"2026-05-17T23:48:40Z"},{"alias_kind":"arxiv_version","alias_value":"1810.12340v2","created_at":"2026-05-17T23:48:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.12340","created_at":"2026-05-17T23:48:40Z"},{"alias_kind":"pith_short_12","alias_value":"FZXEU6CVGAQC","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"FZXEU6CVGAQCOGQ7","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"FZXEU6CV","created_at":"2026-05-18T12:32:25Z"}],"graph_snapshots":[{"event_id":"sha256:b508bd6964d44a39600ab43632f402df0c3d15c774bbdf902401e7f51e738503","target":"graph","created_at":"2026-05-17T23:48:40Z","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":"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$, ","authors_text":"Carl Feghali, John Asplund, Pierre Charbit","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-29T18:38:41Z","title":"Enclosings of Decompositions of Complete Multigraphs in $2$-Edge-Connected $r$-Factorizations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.12340","kind":"arxiv","version":2},"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:3d41d10c6da57d249e0b6723070bb2aef3adc4ac1d3bf5b66ee79a6aa476b548","target":"record","created_at":"2026-05-17T23:48:40Z","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":"1db34f87330a526693d2cb2eae5225aaa7bb263b995bcf78262b6b661044f5f9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-29T18:38:41Z","title_canon_sha256":"8af7b644ab15abb066e1558eab839acff4874e1a50af6887eebd4dd599ace537"},"schema_version":"1.0","source":{"id":"1810.12340","kind":"arxiv","version":2}},"canonical_sha256":"2e6e4a78553020271a1f9c051eab294ac0e1e4dacb437e49a7c8c9e96b22fd31","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2e6e4a78553020271a1f9c051eab294ac0e1e4dacb437e49a7c8c9e96b22fd31","first_computed_at":"2026-05-17T23:48:40.032606Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:48:40.032606Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SlCXvoL2OUYtfUj2Hm9tXd65IBmnUnQLBEb73haQlV08s0N9uPowvbu6jMxatD5kFDCuzyPLQH7vOM5+DLGNBg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:48:40.033292Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.12340","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3d41d10c6da57d249e0b6723070bb2aef3adc4ac1d3bf5b66ee79a6aa476b548","sha256:b508bd6964d44a39600ab43632f402df0c3d15c774bbdf902401e7f51e738503"],"state_sha256":"4266b8390d9a3951e776d5bbc019982c3a98c3e224cacca01fb9709f735abf00"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oWZLXsWJ3VntK1gkXtB1PTL++SIBbqqTErZfmmVanGnR5UTnAm3qk+WxAq463IOJDufDZ+5d+nKrQzKnI0G/Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T19:41:53.439924Z","bundle_sha256":"c43e3406e2c3e122ffffdd52245d4c73bc76c17b098f9684e743c12ddb3b4ea6"}}