{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:OM2YRF2CIEF6KPCHUYFUO2Z5M7","short_pith_number":"pith:OM2YRF2C","schema_version":"1.0","canonical_sha256":"7335889742410be53c47a60b476b3d67f861afe02d4d350c8d936cb2284c1c7b","source":{"kind":"arxiv","id":"1809.05443","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1809.05443","created_at":"2026-05-18T00:05:41.412395+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.05443v1","created_at":"2026-05-18T00:05:41.412395+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.05443","created_at":"2026-05-18T00:05:41.412395+00:00"},{"alias_kind":"pith_short_12","alias_value":"OM2YRF2CIEF6","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_16","alias_value":"OM2YRF2CIEF6KPCH","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_8","alias_value":"OM2YRF2C","created_at":"2026-05-18T12:32:43.782077+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/OM2YRF2CIEF6KPCHUYFUO2Z5M7","json":"https://pith.science/pith/OM2YRF2CIEF6KPCHUYFUO2Z5M7.json","graph_json":"https://pith.science/api/pith-number/OM2YRF2CIEF6KPCHUYFUO2Z5M7/graph.json","events_json":"https://pith.science/api/pith-number/OM2YRF2CIEF6KPCHUYFUO2Z5M7/events.json","paper":"https://pith.science/paper/OM2YRF2C"},"agent_actions":{"view_html":"https://pith.science/pith/OM2YRF2CIEF6KPCHUYFUO2Z5M7","download_json":"https://pith.science/pith/OM2YRF2CIEF6KPCHUYFUO2Z5M7.json","view_paper":"https://pith.science/paper/OM2YRF2C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.05443&json=true","fetch_graph":"https://pith.science/api/pith-number/OM2YRF2CIEF6KPCHUYFUO2Z5M7/graph.json","fetch_events":"https://pith.science/api/pith-number/OM2YRF2CIEF6KPCHUYFUO2Z5M7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OM2YRF2CIEF6KPCHUYFUO2Z5M7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OM2YRF2CIEF6KPCHUYFUO2Z5M7/action/storage_attestation","attest_author":"https://pith.science/pith/OM2YRF2CIEF6KPCHUYFUO2Z5M7/action/author_attestation","sign_citation":"https://pith.science/pith/OM2YRF2CIEF6KPCHUYFUO2Z5M7/action/citation_signature","submit_replication":"https://pith.science/pith/OM2YRF2CIEF6KPCHUYFUO2Z5M7/action/replication_record"}},"created_at":"2026-05-18T00:05:41.412395+00:00","updated_at":"2026-05-18T00:05:41.412395+00:00"}