{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:M2D6NKBOD53JWSY3YWUCMS4IHQ","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":"33f7dee2f83c7b52f9f6535631ac0cb1db2d316b27c046b5534cc46b3e3c063f","cross_cats_sorted":["math-ph","math.MP"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-01-06T20:04:37Z","title_canon_sha256":"64215074d4a4dbd963eb0495269ef0bb0b70430fc97a8d89e94e8104345e0a28"},"schema_version":"1.0","source":{"id":"2501.03363","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.03363","created_at":"2026-07-05T09:57:53Z"},{"alias_kind":"arxiv_version","alias_value":"2501.03363v1","created_at":"2026-07-05T09:57:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.03363","created_at":"2026-07-05T09:57:53Z"},{"alias_kind":"pith_short_12","alias_value":"M2D6NKBOD53J","created_at":"2026-07-05T09:57:53Z"},{"alias_kind":"pith_short_16","alias_value":"M2D6NKBOD53JWSY3","created_at":"2026-07-05T09:57:53Z"},{"alias_kind":"pith_short_8","alias_value":"M2D6NKBO","created_at":"2026-07-05T09:57:53Z"}],"graph_snapshots":[{"event_id":"sha256:a451e2df73b2fa3982cc2b217472e783edbeb770ed211cd8b19933a5762f5a70","target":"graph","created_at":"2026-07-05T09:57:53Z","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/2501.03363/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider the optimisation problem of adding $k$ links to a given network, such that the resulting effective graph resistance is as small as possible. The problem was recently proven to be NP-hard, such that optimal solutions obtained with brute-force methods require exponentially many computation steps and thus are infeasible for any graph of realistic size. Therefore, it is common in such cases to use a simple greedy algorithm to obtain an approximation of the optimal solution. It is known that if the considered problem is submodular, the quality of the greedy solution can be guaranteed. H","authors_text":"Massimo A. Achterberg, Robert E. Kooij","cross_cats":["math-ph","math.MP"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-01-06T20:04:37Z","title":"On the non-submodularity of the problem of adding links to minimize the effective graph resistance"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.03363","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:334cb4c30895e4fea57188dbcee2966a8f062b18af362b00b5c7746db6b8bf7c","target":"record","created_at":"2026-07-05T09:57:53Z","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":"33f7dee2f83c7b52f9f6535631ac0cb1db2d316b27c046b5534cc46b3e3c063f","cross_cats_sorted":["math-ph","math.MP"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-01-06T20:04:37Z","title_canon_sha256":"64215074d4a4dbd963eb0495269ef0bb0b70430fc97a8d89e94e8104345e0a28"},"schema_version":"1.0","source":{"id":"2501.03363","kind":"arxiv","version":1}},"canonical_sha256":"6687e6a82e1f769b4b1bc5a8264b883c14c76683abef9d3fc2ad803fb490bac6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6687e6a82e1f769b4b1bc5a8264b883c14c76683abef9d3fc2ad803fb490bac6","first_computed_at":"2026-07-05T09:57:53.661599Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:57:53.661599Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ucjyVVxniTbumN4jgJr/vXt3x5U0c1KcwtGvxRnv1jj1qc1kjDRiRtx++cn3ZAlP7g0vhxm5QsqeYYKVPgMJCA==","signature_status":"signed_v1","signed_at":"2026-07-05T09:57:53.662030Z","signed_message":"canonical_sha256_bytes"},"source_id":"2501.03363","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:334cb4c30895e4fea57188dbcee2966a8f062b18af362b00b5c7746db6b8bf7c","sha256:a451e2df73b2fa3982cc2b217472e783edbeb770ed211cd8b19933a5762f5a70"],"state_sha256":"3d583be25570d38eb7c43b3c9b1653d14f97658a3a34be547c41239ce207601e"}