{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:DXQ6R5SW2LQQNUFY2DOGCLFO66","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":"b591438514f312f2a35727cf71435a7f732b9f8566b0f86d4c472fd54984a431","cross_cats_sorted":["cs.NI"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DS","submitted_at":"2024-11-18T09:53:17Z","title_canon_sha256":"3fdab2bf034a4f40e403985e2974abfebf166289eeafbd40da0ba29f12751bc7"},"schema_version":"1.0","source":{"id":"2411.11426","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.11426","created_at":"2026-07-05T09:36:56Z"},{"alias_kind":"arxiv_version","alias_value":"2411.11426v1","created_at":"2026-07-05T09:36:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.11426","created_at":"2026-07-05T09:36:56Z"},{"alias_kind":"pith_short_12","alias_value":"DXQ6R5SW2LQQ","created_at":"2026-07-05T09:36:56Z"},{"alias_kind":"pith_short_16","alias_value":"DXQ6R5SW2LQQNUFY","created_at":"2026-07-05T09:36:56Z"},{"alias_kind":"pith_short_8","alias_value":"DXQ6R5SW","created_at":"2026-07-05T09:36:56Z"}],"graph_snapshots":[{"event_id":"sha256:4de9537fe6463466e31f2e867387954d98f8690584338d3b5dd2b91ed18d5246","target":"graph","created_at":"2026-07-05T09:36:56Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2411.11426/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Graph augmentation is a fundamental and well-studied problem that arises in network optimization. We consider a new variant of this model motivated by reconfigurable communication networks. In this variant, we consider a given physical network and the measured communication demands between the nodes. Our goal is to augment the given physical network with a matching, so that the shortest path lengths in the augmented network, weighted with the demands, are minimal.We prove that this problem is NP-hard, even if the physical network is a cycle. We then use results from demand-aware network design","authors_text":"Aleksander Figiel, Andr\\'e Nichterlein, Arash Pourdamghani, Darya Melnyk, Stefan Schmid","cross_cats":["cs.NI"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DS","submitted_at":"2024-11-18T09:53:17Z","title":"SpiderDAN: Matching Augmentation in Demand-Aware Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.11426","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:6b4c1d8ba816d682f4a12c2de659e4af0e70febd43a7c18935b02546d8eebce6","target":"record","created_at":"2026-07-05T09:36:56Z","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":"b591438514f312f2a35727cf71435a7f732b9f8566b0f86d4c472fd54984a431","cross_cats_sorted":["cs.NI"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DS","submitted_at":"2024-11-18T09:53:17Z","title_canon_sha256":"3fdab2bf034a4f40e403985e2974abfebf166289eeafbd40da0ba29f12751bc7"},"schema_version":"1.0","source":{"id":"2411.11426","kind":"arxiv","version":1}},"canonical_sha256":"1de1e8f656d2e106d0b8d0dc612caef7b25ca6cf1aa6ebd5bab7d53321a80c25","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1de1e8f656d2e106d0b8d0dc612caef7b25ca6cf1aa6ebd5bab7d53321a80c25","first_computed_at":"2026-07-05T09:36:56.339745Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:36:56.339745Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aWaR6b4l9XvG72A1S0XscWA56LrKFFO+6KwJBwV7SBBteRbD+7igLe1/aZ2hd6zqvk3SBbb18d7nEpTaaZr6BQ==","signature_status":"signed_v1","signed_at":"2026-07-05T09:36:56.340331Z","signed_message":"canonical_sha256_bytes"},"source_id":"2411.11426","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6b4c1d8ba816d682f4a12c2de659e4af0e70febd43a7c18935b02546d8eebce6","sha256:4de9537fe6463466e31f2e867387954d98f8690584338d3b5dd2b91ed18d5246"],"state_sha256":"1d32d5fbe6b935ebf3d7e1095dbfb100bb4ea587dcab6676afb88e55fd235d11"}