{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:GX3B7QUHIKVUIQHW2Q4KGJUX7E","short_pith_number":"pith:GX3B7QUH","schema_version":"1.0","canonical_sha256":"35f61fc28742ab4440f6d438a32697f903778c3c5a7595100fa7f0fe02b00b07","source":{"kind":"arxiv","id":"1706.04255","version":1},"attestation_state":"computed","paper":{"title":"Structured Connectivity Augmentation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Dimitrios M. Thilikos, Fedor V. Fomin, Petr A. Golovach","submitted_at":"2017-06-13T21:06:37Z","abstract_excerpt":"We initiate the algorithmic study of the following \"structured augmentation\" question: is it possible to increase the connectivity of a given graph G by superposing it with another given graph H? More precisely, graph F is the superposition of G and H with respect to injective mapping \\phi: V(H)->V(G) if every edge uv of F is either an edge of G, or \\phi^{-1}(u)\\phi^{-1}(v) is an edge of H. We consider the following optimization problem. Given graphs G,H, and a weight function \\omega assigning non-negative weights to pairs of vertices of V(G), the task is to find \\varphi of minimum weight \\ome"},"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":"1706.04255","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-06-13T21:06:37Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"e200c16fa9002d3f7ebacd32c811cf5985b4fac2c6d6726f1626681e7e061f48","abstract_canon_sha256":"e04d556b34533c4a7f225346bfb448c37ba56766a6b265c116962b3b2027bf26"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:23.130289Z","signature_b64":"TG+/7HkCS83Ke4TBZXgNwX6W6twu3LdNYVVMhZrUlXpDsakozramRcCKu8+nLH475FuM57rPQrW6ninUqWETDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"35f61fc28742ab4440f6d438a32697f903778c3c5a7595100fa7f0fe02b00b07","last_reissued_at":"2026-05-18T00:42:23.129706Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:23.129706Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Structured Connectivity Augmentation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Dimitrios M. Thilikos, Fedor V. Fomin, Petr A. Golovach","submitted_at":"2017-06-13T21:06:37Z","abstract_excerpt":"We initiate the algorithmic study of the following \"structured augmentation\" question: is it possible to increase the connectivity of a given graph G by superposing it with another given graph H? More precisely, graph F is the superposition of G and H with respect to injective mapping \\phi: V(H)->V(G) if every edge uv of F is either an edge of G, or \\phi^{-1}(u)\\phi^{-1}(v) is an edge of H. We consider the following optimization problem. Given graphs G,H, and a weight function \\omega assigning non-negative weights to pairs of vertices of V(G), the task is to find \\varphi of minimum weight \\ome"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.04255","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":"1706.04255","created_at":"2026-05-18T00:42:23.129792+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.04255v1","created_at":"2026-05-18T00:42:23.129792+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.04255","created_at":"2026-05-18T00:42:23.129792+00:00"},{"alias_kind":"pith_short_12","alias_value":"GX3B7QUHIKVU","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_16","alias_value":"GX3B7QUHIKVUIQHW","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_8","alias_value":"GX3B7QUH","created_at":"2026-05-18T12:31:18.294218+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/GX3B7QUHIKVUIQHW2Q4KGJUX7E","json":"https://pith.science/pith/GX3B7QUHIKVUIQHW2Q4KGJUX7E.json","graph_json":"https://pith.science/api/pith-number/GX3B7QUHIKVUIQHW2Q4KGJUX7E/graph.json","events_json":"https://pith.science/api/pith-number/GX3B7QUHIKVUIQHW2Q4KGJUX7E/events.json","paper":"https://pith.science/paper/GX3B7QUH"},"agent_actions":{"view_html":"https://pith.science/pith/GX3B7QUHIKVUIQHW2Q4KGJUX7E","download_json":"https://pith.science/pith/GX3B7QUHIKVUIQHW2Q4KGJUX7E.json","view_paper":"https://pith.science/paper/GX3B7QUH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.04255&json=true","fetch_graph":"https://pith.science/api/pith-number/GX3B7QUHIKVUIQHW2Q4KGJUX7E/graph.json","fetch_events":"https://pith.science/api/pith-number/GX3B7QUHIKVUIQHW2Q4KGJUX7E/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GX3B7QUHIKVUIQHW2Q4KGJUX7E/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GX3B7QUHIKVUIQHW2Q4KGJUX7E/action/storage_attestation","attest_author":"https://pith.science/pith/GX3B7QUHIKVUIQHW2Q4KGJUX7E/action/author_attestation","sign_citation":"https://pith.science/pith/GX3B7QUHIKVUIQHW2Q4KGJUX7E/action/citation_signature","submit_replication":"https://pith.science/pith/GX3B7QUHIKVUIQHW2Q4KGJUX7E/action/replication_record"}},"created_at":"2026-05-18T00:42:23.129792+00:00","updated_at":"2026-05-18T00:42:23.129792+00:00"}