{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:X22I6DOY7Y2QCLHB35F6SZFB7S","short_pith_number":"pith:X22I6DOY","schema_version":"1.0","canonical_sha256":"beb48f0dd8fe35012ce1df4be964a1fca373b2e80cb4808353006560d7547fdb","source":{"kind":"arxiv","id":"1408.2436","version":1},"attestation_state":"computed","paper":{"title":"Compatible Connectivity-Augmentation of Planar Disconnected Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Fabrizio Frati, Greg Aloupis, Luis Barba, Pat Morin, Paz Carmi, Vida Dujmovi\\'c","submitted_at":"2014-08-11T15:24:32Z","abstract_excerpt":"Motivated by applications to graph morphing, we consider the following \\emph{compatible connectivity-augmentation problem}: We are given a labelled $n$-vertex planar graph, $\\mathcal{G}$, that has $r\\ge 2$ connected components, and $k\\ge 2$ isomorphic planar straight-line drawings, $G_1,\\ldots,G_k$, of $\\mathcal{G}$. We wish to augment $\\mathcal G$ by adding vertices and edges to make it connected in such a way that these vertices and edges can be added to $G_1,\\ldots,G_k$ as points and straight-line segments, respectively, to obtain $k$ planar straight-line drawings isomorphic to the augmenta"},"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":"1408.2436","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-08-11T15:24:32Z","cross_cats_sorted":[],"title_canon_sha256":"5115df421ca41aae4fe40b9ce3e3992676deb0291a65eba193c40e499e4bdb70","abstract_canon_sha256":"0afb7ae434c7c3bf0bfe9f1a679a0a4b557e3139ff5f902540df68c7db753e4c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:45:29.372719Z","signature_b64":"63nYKW/1ze3nVzzSKjTYkUbb+zDDRyTv8KHbmnQMb/7HOOBsmrulWIVdIa6XTi0KlbCytCdkZYAVVHgbFANpBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"beb48f0dd8fe35012ce1df4be964a1fca373b2e80cb4808353006560d7547fdb","last_reissued_at":"2026-05-18T02:45:29.372219Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:45:29.372219Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Compatible Connectivity-Augmentation of Planar Disconnected Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Fabrizio Frati, Greg Aloupis, Luis Barba, Pat Morin, Paz Carmi, Vida Dujmovi\\'c","submitted_at":"2014-08-11T15:24:32Z","abstract_excerpt":"Motivated by applications to graph morphing, we consider the following \\emph{compatible connectivity-augmentation problem}: We are given a labelled $n$-vertex planar graph, $\\mathcal{G}$, that has $r\\ge 2$ connected components, and $k\\ge 2$ isomorphic planar straight-line drawings, $G_1,\\ldots,G_k$, of $\\mathcal{G}$. We wish to augment $\\mathcal G$ by adding vertices and edges to make it connected in such a way that these vertices and edges can be added to $G_1,\\ldots,G_k$ as points and straight-line segments, respectively, to obtain $k$ planar straight-line drawings isomorphic to the augmenta"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.2436","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":"1408.2436","created_at":"2026-05-18T02:45:29.372298+00:00"},{"alias_kind":"arxiv_version","alias_value":"1408.2436v1","created_at":"2026-05-18T02:45:29.372298+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.2436","created_at":"2026-05-18T02:45:29.372298+00:00"},{"alias_kind":"pith_short_12","alias_value":"X22I6DOY7Y2Q","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_16","alias_value":"X22I6DOY7Y2QCLHB","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_8","alias_value":"X22I6DOY","created_at":"2026-05-18T12:28:54.890064+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/X22I6DOY7Y2QCLHB35F6SZFB7S","json":"https://pith.science/pith/X22I6DOY7Y2QCLHB35F6SZFB7S.json","graph_json":"https://pith.science/api/pith-number/X22I6DOY7Y2QCLHB35F6SZFB7S/graph.json","events_json":"https://pith.science/api/pith-number/X22I6DOY7Y2QCLHB35F6SZFB7S/events.json","paper":"https://pith.science/paper/X22I6DOY"},"agent_actions":{"view_html":"https://pith.science/pith/X22I6DOY7Y2QCLHB35F6SZFB7S","download_json":"https://pith.science/pith/X22I6DOY7Y2QCLHB35F6SZFB7S.json","view_paper":"https://pith.science/paper/X22I6DOY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1408.2436&json=true","fetch_graph":"https://pith.science/api/pith-number/X22I6DOY7Y2QCLHB35F6SZFB7S/graph.json","fetch_events":"https://pith.science/api/pith-number/X22I6DOY7Y2QCLHB35F6SZFB7S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X22I6DOY7Y2QCLHB35F6SZFB7S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X22I6DOY7Y2QCLHB35F6SZFB7S/action/storage_attestation","attest_author":"https://pith.science/pith/X22I6DOY7Y2QCLHB35F6SZFB7S/action/author_attestation","sign_citation":"https://pith.science/pith/X22I6DOY7Y2QCLHB35F6SZFB7S/action/citation_signature","submit_replication":"https://pith.science/pith/X22I6DOY7Y2QCLHB35F6SZFB7S/action/replication_record"}},"created_at":"2026-05-18T02:45:29.372298+00:00","updated_at":"2026-05-18T02:45:29.372298+00:00"}