{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:OM2YRF2CIEF6KPCHUYFUO2Z5M7","short_pith_number":"pith:OM2YRF2C","canonical_record":{"source":{"id":"1809.05443","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-09-14T14:38:22Z","cross_cats_sorted":["cs.CC","math.CO"],"title_canon_sha256":"e23dd719ccc88cad73c93d1079022eafe202412a7bc48ea9ad3fc7347c9e5d90","abstract_canon_sha256":"fe80e152cc95afb7239883ce44619a8714182c5a367e0596399bb362d538f829"},"schema_version":"1.0"},"canonical_sha256":"7335889742410be53c47a60b476b3d67f861afe02d4d350c8d936cb2284c1c7b","source":{"kind":"arxiv","id":"1809.05443","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.05443","created_at":"2026-05-18T00:05:41Z"},{"alias_kind":"arxiv_version","alias_value":"1809.05443v1","created_at":"2026-05-18T00:05:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.05443","created_at":"2026-05-18T00:05:41Z"},{"alias_kind":"pith_short_12","alias_value":"OM2YRF2CIEF6","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"OM2YRF2CIEF6KPCH","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"OM2YRF2C","created_at":"2026-05-18T12:32:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:OM2YRF2CIEF6KPCHUYFUO2Z5M7","target":"record","payload":{"canonical_record":{"source":{"id":"1809.05443","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-09-14T14:38:22Z","cross_cats_sorted":["cs.CC","math.CO"],"title_canon_sha256":"e23dd719ccc88cad73c93d1079022eafe202412a7bc48ea9ad3fc7347c9e5d90","abstract_canon_sha256":"fe80e152cc95afb7239883ce44619a8714182c5a367e0596399bb362d538f829"},"schema_version":"1.0"},"canonical_sha256":"7335889742410be53c47a60b476b3d67f861afe02d4d350c8d936cb2284c1c7b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:41.412876Z","signature_b64":"6FRu5S+WEHX8efaaZ+0D/GSsnbHzqq6Ra5Z9bPX+Se3pF01GRApx38IpNUxasrQLISvV18n5yRGgEg42xwIxDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7335889742410be53c47a60b476b3d67f861afe02d4d350c8d936cb2284c1c7b","last_reissued_at":"2026-05-18T00:05:41.412290Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:41.412290Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.05443","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-18T00:05:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5rNLR82BhgqBq03W7t3TnV8ULjYuj3aUhjvN9Q7gBIDqOVdx1wiWf2BCbKLvsMXvUItpdv4h9sWBJqwHn7jGCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T12:15:36.127455Z"},"content_sha256":"674e07f648fd2709f4604f8e80a0d61e1c4c4e497734fcbf0ccde16fa2122673","schema_version":"1.0","event_id":"sha256:674e07f648fd2709f4604f8e80a0d61e1c4c4e497734fcbf0ccde16fa2122673"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:OM2YRF2CIEF6KPCHUYFUO2Z5M7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Reconfiguration of graphs with connectivity constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.CO"],"primary_cat":"cs.DM","authors_text":"Arnaud Mary, Nicolas Bousquet","submitted_at":"2018-09-14T14:38:22Z","abstract_excerpt":"A graph $G$ realizes the degree sequence $S$ if the degrees of its vertices is $S$. Hakimi gave a necessary and sufficient condition to guarantee that there exists a connected multigraph realizing $S$. Taylor later proved that any connected multigraph can be transformed into any other via a sequence of flips (maintaining connectivity at any step). A flip consists in replacing two edges $ab$ and $cd$ by the diagonals $ac$ and $bd$. In this paper, we study a generalization of this problem. A set of subsets of vertices $\\mathcal{CC}$ is \\emph{nested} if for every $C,C' \\in \\mathcal{CC}$ either $C"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.05443","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-18T00:05:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0hOKQ/CBVhE5jw9h6LYm6CgPQG1HDRDxsniWcwnqjiWeMa6JlD27UvcpoU+2kGg+DElma7S047n0ozC9MT9aDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T12:15:36.128143Z"},"content_sha256":"430595063f0822aef88c24e7c92d7f59eae5ef3e11155c0f19bf7a628389a5e4","schema_version":"1.0","event_id":"sha256:430595063f0822aef88c24e7c92d7f59eae5ef3e11155c0f19bf7a628389a5e4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OM2YRF2CIEF6KPCHUYFUO2Z5M7/bundle.json","state_url":"https://pith.science/pith/OM2YRF2CIEF6KPCHUYFUO2Z5M7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OM2YRF2CIEF6KPCHUYFUO2Z5M7/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-26T12:15:36Z","links":{"resolver":"https://pith.science/pith/OM2YRF2CIEF6KPCHUYFUO2Z5M7","bundle":"https://pith.science/pith/OM2YRF2CIEF6KPCHUYFUO2Z5M7/bundle.json","state":"https://pith.science/pith/OM2YRF2CIEF6KPCHUYFUO2Z5M7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OM2YRF2CIEF6KPCHUYFUO2Z5M7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:OM2YRF2CIEF6KPCHUYFUO2Z5M7","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":"fe80e152cc95afb7239883ce44619a8714182c5a367e0596399bb362d538f829","cross_cats_sorted":["cs.CC","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-09-14T14:38:22Z","title_canon_sha256":"e23dd719ccc88cad73c93d1079022eafe202412a7bc48ea9ad3fc7347c9e5d90"},"schema_version":"1.0","source":{"id":"1809.05443","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.05443","created_at":"2026-05-18T00:05:41Z"},{"alias_kind":"arxiv_version","alias_value":"1809.05443v1","created_at":"2026-05-18T00:05:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.05443","created_at":"2026-05-18T00:05:41Z"},{"alias_kind":"pith_short_12","alias_value":"OM2YRF2CIEF6","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"OM2YRF2CIEF6KPCH","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"OM2YRF2C","created_at":"2026-05-18T12:32:43Z"}],"graph_snapshots":[{"event_id":"sha256:430595063f0822aef88c24e7c92d7f59eae5ef3e11155c0f19bf7a628389a5e4","target":"graph","created_at":"2026-05-18T00:05:41Z","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 graph $G$ realizes the degree sequence $S$ if the degrees of its vertices is $S$. Hakimi gave a necessary and sufficient condition to guarantee that there exists a connected multigraph realizing $S$. Taylor later proved that any connected multigraph can be transformed into any other via a sequence of flips (maintaining connectivity at any step). A flip consists in replacing two edges $ab$ and $cd$ by the diagonals $ac$ and $bd$. In this paper, we study a generalization of this problem. A set of subsets of vertices $\\mathcal{CC}$ is \\emph{nested} if for every $C,C' \\in \\mathcal{CC}$ either $C","authors_text":"Arnaud Mary, Nicolas Bousquet","cross_cats":["cs.CC","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-09-14T14:38:22Z","title":"Reconfiguration of graphs with connectivity constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.05443","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:674e07f648fd2709f4604f8e80a0d61e1c4c4e497734fcbf0ccde16fa2122673","target":"record","created_at":"2026-05-18T00:05:41Z","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":"fe80e152cc95afb7239883ce44619a8714182c5a367e0596399bb362d538f829","cross_cats_sorted":["cs.CC","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-09-14T14:38:22Z","title_canon_sha256":"e23dd719ccc88cad73c93d1079022eafe202412a7bc48ea9ad3fc7347c9e5d90"},"schema_version":"1.0","source":{"id":"1809.05443","kind":"arxiv","version":1}},"canonical_sha256":"7335889742410be53c47a60b476b3d67f861afe02d4d350c8d936cb2284c1c7b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7335889742410be53c47a60b476b3d67f861afe02d4d350c8d936cb2284c1c7b","first_computed_at":"2026-05-18T00:05:41.412290Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:05:41.412290Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6FRu5S+WEHX8efaaZ+0D/GSsnbHzqq6Ra5Z9bPX+Se3pF01GRApx38IpNUxasrQLISvV18n5yRGgEg42xwIxDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:05:41.412876Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.05443","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:674e07f648fd2709f4604f8e80a0d61e1c4c4e497734fcbf0ccde16fa2122673","sha256:430595063f0822aef88c24e7c92d7f59eae5ef3e11155c0f19bf7a628389a5e4"],"state_sha256":"3e08bf99592963b18ccba5cf330aa236ace7333822cf88ef349fd634cab96aa6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"//hio0dH8dNI7pFrdNA1IdWvYMIDejGv6V6H75y0afmVTp167Y8VxxX5aYehqZQ6fuNdzC3X4x5jt+jGhZKkDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T12:15:36.132016Z","bundle_sha256":"9bbaac05496519b413d754209d11d6075a383e38c40e6dfb88621d2dbb23182d"}}