{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:VA5ZE2SOPYUIB2KYKJIXF5OITS","short_pith_number":"pith:VA5ZE2SO","canonical_record":{"source":{"id":"1411.3640","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-11-13T18:01:33Z","cross_cats_sorted":[],"title_canon_sha256":"a43a11b6b228bd63754f17371cb70873cc76bdb9182e74d0d73e4d7a9bb6af2b","abstract_canon_sha256":"69f523c8d5a90bd3028d5e8bf3e10f5c649c753b94498b533de617b2542cd289"},"schema_version":"1.0"},"canonical_sha256":"a83b926a4e7e2880e958525172f5c89c8d047139c514b6f31ad514f1f6bdf619","source":{"kind":"arxiv","id":"1411.3640","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.3640","created_at":"2026-05-18T02:37:43Z"},{"alias_kind":"arxiv_version","alias_value":"1411.3640v1","created_at":"2026-05-18T02:37:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.3640","created_at":"2026-05-18T02:37:43Z"},{"alias_kind":"pith_short_12","alias_value":"VA5ZE2SOPYUI","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"VA5ZE2SOPYUIB2KY","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"VA5ZE2SO","created_at":"2026-05-18T12:28:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:VA5ZE2SOPYUIB2KYKJIXF5OITS","target":"record","payload":{"canonical_record":{"source":{"id":"1411.3640","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-11-13T18:01:33Z","cross_cats_sorted":[],"title_canon_sha256":"a43a11b6b228bd63754f17371cb70873cc76bdb9182e74d0d73e4d7a9bb6af2b","abstract_canon_sha256":"69f523c8d5a90bd3028d5e8bf3e10f5c649c753b94498b533de617b2542cd289"},"schema_version":"1.0"},"canonical_sha256":"a83b926a4e7e2880e958525172f5c89c8d047139c514b6f31ad514f1f6bdf619","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:37:43.275197Z","signature_b64":"Xh5/FtDjYmoVsVfk1kYdt54KGwvcGOXRT6V6Az5yYheUCbjxhZ8GTmvBLcsQn+9VLOSX0qr/RPUnWdKlvg2cCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a83b926a4e7e2880e958525172f5c89c8d047139c514b6f31ad514f1f6bdf619","last_reissued_at":"2026-05-18T02:37:43.274824Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:37:43.274824Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1411.3640","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-18T02:37:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3hDfp5qZF07wDfao7doW2nrXwOEbFxUerB0a1LoK3SSaW/tMYMjtGMNo1QOAez7oeNe5aH98td1ZC19oYwwMDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T23:47:27.015763Z"},"content_sha256":"2575ffa2d7c8fb79995f2f4435dca43fad97689913b1d7edb8e5973960c5d11c","schema_version":"1.0","event_id":"sha256:2575ffa2d7c8fb79995f2f4435dca43fad97689913b1d7edb8e5973960c5d11c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:VA5ZE2SOPYUIB2KYKJIXF5OITS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Network installation and recovery: approximation lower bounds and faster exact formulations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"\\'Ad\\'am D. Lelkes, Alexander Gutfraind, Jeremy Kun, Lev Reyzin","submitted_at":"2014-11-13T18:01:33Z","abstract_excerpt":"We study the Neighbor Aided Network Installation Problem (NANIP) introduced previously which asks for a minimal cost ordering of the vertices of a graph, where the cost of visiting a node is a function of the number of neighbors that have already been visited. This problem has applications in resource management and disaster recovery. In this paper we analyze the computational hardness of NANIP. In particular we show that this problem is NP-hard even when restricted to convex decreasing cost functions, give a linear approximation lower bound for the greedy algorithm, and prove a general sub-co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.3640","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-18T02:37:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k+D54Mk3nzBbRBTFzHF1UMyXjXaeLXQQbiJeDahjKb12OyAqzBZg0cow3u9XL+cgeSmvRfklr03XwtjASEsVAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T23:47:27.016136Z"},"content_sha256":"8a2c435b1d8a2c5474f50858d36d4b1471e3477125a4728ede1340d9847bf126","schema_version":"1.0","event_id":"sha256:8a2c435b1d8a2c5474f50858d36d4b1471e3477125a4728ede1340d9847bf126"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VA5ZE2SOPYUIB2KYKJIXF5OITS/bundle.json","state_url":"https://pith.science/pith/VA5ZE2SOPYUIB2KYKJIXF5OITS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VA5ZE2SOPYUIB2KYKJIXF5OITS/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-06-21T23:47:27Z","links":{"resolver":"https://pith.science/pith/VA5ZE2SOPYUIB2KYKJIXF5OITS","bundle":"https://pith.science/pith/VA5ZE2SOPYUIB2KYKJIXF5OITS/bundle.json","state":"https://pith.science/pith/VA5ZE2SOPYUIB2KYKJIXF5OITS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VA5ZE2SOPYUIB2KYKJIXF5OITS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:VA5ZE2SOPYUIB2KYKJIXF5OITS","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":"69f523c8d5a90bd3028d5e8bf3e10f5c649c753b94498b533de617b2542cd289","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-11-13T18:01:33Z","title_canon_sha256":"a43a11b6b228bd63754f17371cb70873cc76bdb9182e74d0d73e4d7a9bb6af2b"},"schema_version":"1.0","source":{"id":"1411.3640","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.3640","created_at":"2026-05-18T02:37:43Z"},{"alias_kind":"arxiv_version","alias_value":"1411.3640v1","created_at":"2026-05-18T02:37:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.3640","created_at":"2026-05-18T02:37:43Z"},{"alias_kind":"pith_short_12","alias_value":"VA5ZE2SOPYUI","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"VA5ZE2SOPYUIB2KY","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"VA5ZE2SO","created_at":"2026-05-18T12:28:52Z"}],"graph_snapshots":[{"event_id":"sha256:8a2c435b1d8a2c5474f50858d36d4b1471e3477125a4728ede1340d9847bf126","target":"graph","created_at":"2026-05-18T02:37:43Z","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 study the Neighbor Aided Network Installation Problem (NANIP) introduced previously which asks for a minimal cost ordering of the vertices of a graph, where the cost of visiting a node is a function of the number of neighbors that have already been visited. This problem has applications in resource management and disaster recovery. In this paper we analyze the computational hardness of NANIP. In particular we show that this problem is NP-hard even when restricted to convex decreasing cost functions, give a linear approximation lower bound for the greedy algorithm, and prove a general sub-co","authors_text":"\\'Ad\\'am D. Lelkes, Alexander Gutfraind, Jeremy Kun, Lev Reyzin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-11-13T18:01:33Z","title":"Network installation and recovery: approximation lower bounds and faster exact formulations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.3640","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:2575ffa2d7c8fb79995f2f4435dca43fad97689913b1d7edb8e5973960c5d11c","target":"record","created_at":"2026-05-18T02:37:43Z","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":"69f523c8d5a90bd3028d5e8bf3e10f5c649c753b94498b533de617b2542cd289","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-11-13T18:01:33Z","title_canon_sha256":"a43a11b6b228bd63754f17371cb70873cc76bdb9182e74d0d73e4d7a9bb6af2b"},"schema_version":"1.0","source":{"id":"1411.3640","kind":"arxiv","version":1}},"canonical_sha256":"a83b926a4e7e2880e958525172f5c89c8d047139c514b6f31ad514f1f6bdf619","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a83b926a4e7e2880e958525172f5c89c8d047139c514b6f31ad514f1f6bdf619","first_computed_at":"2026-05-18T02:37:43.274824Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:37:43.274824Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Xh5/FtDjYmoVsVfk1kYdt54KGwvcGOXRT6V6Az5yYheUCbjxhZ8GTmvBLcsQn+9VLOSX0qr/RPUnWdKlvg2cCw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:37:43.275197Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.3640","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2575ffa2d7c8fb79995f2f4435dca43fad97689913b1d7edb8e5973960c5d11c","sha256:8a2c435b1d8a2c5474f50858d36d4b1471e3477125a4728ede1340d9847bf126"],"state_sha256":"2c37b8dfb004ad88a9007b436804ee1abd4376c58e33546940629b9ad3048662"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"142TvIS5h9oBNdEz145BZ8ink2w0vqYFX5YAeFv8c9owQRXJtbm+SlwdU7QEssgrs4rf+R3Mhgpahw3P5U2FAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T23:47:27.018118Z","bundle_sha256":"9f82f40de7ae562cd31ab2de3e4dad338f70e8fe9cbb1eb2a5088f8b227542f9"}}