{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:S3A56FCTQHOMO23NOLVRIS5I7F","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":"84a369a921d8d6a3a162a956b002c28aec266cd9b21ad22496a0f7a2d230b0cc","cross_cats_sorted":["cs.NI","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-03-02T18:38:59Z","title_canon_sha256":"34044d00fe01d5367269a1d7c26d8706429e9c706c8b3d965ae86ddfeb584bff"},"schema_version":"1.0","source":{"id":"1203.0543","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.0543","created_at":"2026-05-18T01:10:15Z"},{"alias_kind":"arxiv_version","alias_value":"1203.0543v3","created_at":"2026-05-18T01:10:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.0543","created_at":"2026-05-18T01:10:15Z"},{"alias_kind":"pith_short_12","alias_value":"S3A56FCTQHOM","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"S3A56FCTQHOMO23N","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"S3A56FCT","created_at":"2026-05-18T12:27:20Z"}],"graph_snapshots":[{"event_id":"sha256:3e0d00793833d408a3bd38fe1466df2b64072496f028e9964263fbbafadb52ed","target":"graph","created_at":"2026-05-18T01:10:15Z","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":"The growing amount of applications that generate vast amount of data in short time scales render the problem of partial monitoring, coupled with prediction, a rather fundamental one. We study the aforementioned canonical problem under the context of large-scale monitoring of communication networks. We consider the problem of selecting the \"best\" subset of links so as to optimally predict the quantity of interest at the remaining ones. This is a well know NP-hard problem, and algorithms seeking the exact solution are prohibitively expensive. We present a number of approximation algorithms that:","authors_text":"George Michailidis, Michalis Kallitsis, Stilian Stoev","cross_cats":["cs.NI","math.ST","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-03-02T18:38:59Z","title":"Efficient Approximation Algorithms for Optimal Large-scale Network Monitoring"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.0543","kind":"arxiv","version":3},"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:a09487f6746ccfc1a6cc493f57aee56d682ed4c857215d5f6f2b04fdad66b5d6","target":"record","created_at":"2026-05-18T01:10:15Z","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":"84a369a921d8d6a3a162a956b002c28aec266cd9b21ad22496a0f7a2d230b0cc","cross_cats_sorted":["cs.NI","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-03-02T18:38:59Z","title_canon_sha256":"34044d00fe01d5367269a1d7c26d8706429e9c706c8b3d965ae86ddfeb584bff"},"schema_version":"1.0","source":{"id":"1203.0543","kind":"arxiv","version":3}},"canonical_sha256":"96c1df145381dcc76b6d72eb144ba8f95a9eb37e4febd5ad14381dad70186d1e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"96c1df145381dcc76b6d72eb144ba8f95a9eb37e4febd5ad14381dad70186d1e","first_computed_at":"2026-05-18T01:10:15.500669Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:10:15.500669Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eKB2FtA1ZIN6yTctRfUf0I+v0NzZaX3x0EjEju9hwvv/EHUjRy/EYvJcwE/K9Pew0FDi1lO0pkEwiHsoYxtQDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:10:15.501067Z","signed_message":"canonical_sha256_bytes"},"source_id":"1203.0543","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a09487f6746ccfc1a6cc493f57aee56d682ed4c857215d5f6f2b04fdad66b5d6","sha256:3e0d00793833d408a3bd38fe1466df2b64072496f028e9964263fbbafadb52ed"],"state_sha256":"f825ec6b47c81fc05e2065f690fed04692b275b47cf0173b6eefb5f618b089ea"}