{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:EOG6ZQ5QOPJ3W5YPRPJTX4SOPF","short_pith_number":"pith:EOG6ZQ5Q","canonical_record":{"source":{"id":"1904.03219","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-05T18:24:08Z","cross_cats_sorted":[],"title_canon_sha256":"e5533b0c2e2bb21c00b4f8d50f8197e3228b7258f706b0006bc6106779f31fbb","abstract_canon_sha256":"4dd95ed4bf51bfff382e8e522fb193cdaa33e6ed9054b3ce9d5788e7e4570de8"},"schema_version":"1.0"},"canonical_sha256":"238decc3b073d3bb770f8bd33bf24e795b613d3f61e81da34394cd6c2f7c31fc","source":{"kind":"arxiv","id":"1904.03219","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.03219","created_at":"2026-05-17T23:49:14Z"},{"alias_kind":"arxiv_version","alias_value":"1904.03219v1","created_at":"2026-05-17T23:49:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.03219","created_at":"2026-05-17T23:49:14Z"},{"alias_kind":"pith_short_12","alias_value":"EOG6ZQ5QOPJ3","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"EOG6ZQ5QOPJ3W5YP","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"EOG6ZQ5Q","created_at":"2026-05-18T12:33:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:EOG6ZQ5QOPJ3W5YPRPJTX4SOPF","target":"record","payload":{"canonical_record":{"source":{"id":"1904.03219","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-05T18:24:08Z","cross_cats_sorted":[],"title_canon_sha256":"e5533b0c2e2bb21c00b4f8d50f8197e3228b7258f706b0006bc6106779f31fbb","abstract_canon_sha256":"4dd95ed4bf51bfff382e8e522fb193cdaa33e6ed9054b3ce9d5788e7e4570de8"},"schema_version":"1.0"},"canonical_sha256":"238decc3b073d3bb770f8bd33bf24e795b613d3f61e81da34394cd6c2f7c31fc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:49:14.190867Z","signature_b64":"YWlQ295gMm7HwYcWiEOm9loBkTXxWo+C6+E0MEpKlYdUsywK9e8SO01+t9QZlrBCNohweAvgzL+k0FV0zgGVCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"238decc3b073d3bb770f8bd33bf24e795b613d3f61e81da34394cd6c2f7c31fc","last_reissued_at":"2026-05-17T23:49:14.190244Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:49:14.190244Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1904.03219","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:49:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dS5GIJ2cdxOEk8Fz7WfD9hpM9SmpmJE0wsDVgPyLQwMz2EI5kxDoq1mVFQg/g5YXJ9qp4RruEoxWtArWXyArAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T10:16:37.072305Z"},"content_sha256":"76859277eff722522f733b9c745ec0c25a2b7f41897427b52cd754b6daa2dcf5","schema_version":"1.0","event_id":"sha256:76859277eff722522f733b9c745ec0c25a2b7f41897427b52cd754b6daa2dcf5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:EOG6ZQ5QOPJ3W5YPRPJTX4SOPF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Network design for s-t effective resistance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Aaron Schild, Hong Zhou, Lap Chi Lau, Pak Hay Chan, Sam Chiu-wai Wong","submitted_at":"2019-04-05T18:24:08Z","abstract_excerpt":"We consider a new problem of designing a network with small $s$-$t$ effective resistance. In this problem, we are given an undirected graph $G=(V,E)$, two designated vertices $s,t \\in V$, and a budget $k$. The goal is to choose a subgraph of $G$ with at most $k$ edges to minimize the $s$-$t$ effective resistance. This problem is an interpolation between the shortest path problem and the minimum cost flow problem and has applications in electrical network design.\n  We present several algorithmic and hardness results for this problem and its variants. On the hardness side, we show that the probl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.03219","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:49:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GdoWXig3qfYGpDN+QWUbV+FwQ083cCjkqdqBnKTmg+WSJuVWvX16L+zZeYSR4Xsz0ixXnPzVLuxR1NKVhak0AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T10:16:37.072733Z"},"content_sha256":"697b3256a2524730e38863244318eb1f84185f86a5693e73b266005492876012","schema_version":"1.0","event_id":"sha256:697b3256a2524730e38863244318eb1f84185f86a5693e73b266005492876012"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EOG6ZQ5QOPJ3W5YPRPJTX4SOPF/bundle.json","state_url":"https://pith.science/pith/EOG6ZQ5QOPJ3W5YPRPJTX4SOPF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EOG6ZQ5QOPJ3W5YPRPJTX4SOPF/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-27T10:16:37Z","links":{"resolver":"https://pith.science/pith/EOG6ZQ5QOPJ3W5YPRPJTX4SOPF","bundle":"https://pith.science/pith/EOG6ZQ5QOPJ3W5YPRPJTX4SOPF/bundle.json","state":"https://pith.science/pith/EOG6ZQ5QOPJ3W5YPRPJTX4SOPF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EOG6ZQ5QOPJ3W5YPRPJTX4SOPF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:EOG6ZQ5QOPJ3W5YPRPJTX4SOPF","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":"4dd95ed4bf51bfff382e8e522fb193cdaa33e6ed9054b3ce9d5788e7e4570de8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-05T18:24:08Z","title_canon_sha256":"e5533b0c2e2bb21c00b4f8d50f8197e3228b7258f706b0006bc6106779f31fbb"},"schema_version":"1.0","source":{"id":"1904.03219","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.03219","created_at":"2026-05-17T23:49:14Z"},{"alias_kind":"arxiv_version","alias_value":"1904.03219v1","created_at":"2026-05-17T23:49:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.03219","created_at":"2026-05-17T23:49:14Z"},{"alias_kind":"pith_short_12","alias_value":"EOG6ZQ5QOPJ3","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"EOG6ZQ5QOPJ3W5YP","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"EOG6ZQ5Q","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:697b3256a2524730e38863244318eb1f84185f86a5693e73b266005492876012","target":"graph","created_at":"2026-05-17T23:49:14Z","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"},"paper":{"abstract_excerpt":"We consider a new problem of designing a network with small $s$-$t$ effective resistance. In this problem, we are given an undirected graph $G=(V,E)$, two designated vertices $s,t \\in V$, and a budget $k$. The goal is to choose a subgraph of $G$ with at most $k$ edges to minimize the $s$-$t$ effective resistance. This problem is an interpolation between the shortest path problem and the minimum cost flow problem and has applications in electrical network design.\n  We present several algorithmic and hardness results for this problem and its variants. On the hardness side, we show that the probl","authors_text":"Aaron Schild, Hong Zhou, Lap Chi Lau, Pak Hay Chan, Sam Chiu-wai Wong","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-05T18:24:08Z","title":"Network design for s-t effective resistance"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.03219","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:76859277eff722522f733b9c745ec0c25a2b7f41897427b52cd754b6daa2dcf5","target":"record","created_at":"2026-05-17T23:49:14Z","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":"4dd95ed4bf51bfff382e8e522fb193cdaa33e6ed9054b3ce9d5788e7e4570de8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-05T18:24:08Z","title_canon_sha256":"e5533b0c2e2bb21c00b4f8d50f8197e3228b7258f706b0006bc6106779f31fbb"},"schema_version":"1.0","source":{"id":"1904.03219","kind":"arxiv","version":1}},"canonical_sha256":"238decc3b073d3bb770f8bd33bf24e795b613d3f61e81da34394cd6c2f7c31fc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"238decc3b073d3bb770f8bd33bf24e795b613d3f61e81da34394cd6c2f7c31fc","first_computed_at":"2026-05-17T23:49:14.190244Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:49:14.190244Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YWlQ295gMm7HwYcWiEOm9loBkTXxWo+C6+E0MEpKlYdUsywK9e8SO01+t9QZlrBCNohweAvgzL+k0FV0zgGVCw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:49:14.190867Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.03219","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:76859277eff722522f733b9c745ec0c25a2b7f41897427b52cd754b6daa2dcf5","sha256:697b3256a2524730e38863244318eb1f84185f86a5693e73b266005492876012"],"state_sha256":"cd66b81929af8744b39ea602bb8c2a6c0e31c3cbeb3013f127a3c747e7a4a065"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tJei+32Rlw2Sh6URJPZUsiokAau6VQYzdFF4KtEu4r2Pb3vn8Q1wp3cFahdHYU0qQLOMxQnYqBolgvfO1602DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T10:16:37.075393Z","bundle_sha256":"b23195c27e5b6e00221cb7f4ce326f9c6998bb4f2d4649dd04e593c82d65d121"}}