{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:GEOMQWTY6YTUS5AGSKNI3ONRTO","short_pith_number":"pith:GEOMQWTY","schema_version":"1.0","canonical_sha256":"311cc85a78f627497406929a8db9b19bb18c7512b761ed3deb3009bd35349ff0","source":{"kind":"arxiv","id":"1108.3048","version":2},"attestation_state":"computed","paper":{"title":"Fast Approximation Algorithms for Near-optimal Large-scale Network Monitoring","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"George Michailidis, Michael Kallitsis, Stilian Stoev","submitted_at":"2011-08-15T18:27:11Z","abstract_excerpt":"We study the problem of optimal traffic prediction and monitoring in large-scale networks. Our goal is to determine which subset of K links to monitor in order to \"best\" predict the traffic on the remaining links in the network. We consider several optimality criteria. This can be formulated as a combinatorial optimization problem, belonging to the family of subset selection problems. Similar NP-hard problems arise in statistics, machine learning and signal processing. Some include subset selection for regression, variable selection, and sparse approximation. Exact solutions are computationall"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1108.3048","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-08-15T18:27:11Z","cross_cats_sorted":[],"title_canon_sha256":"81c775328f2ae7399eba1511b3dd525fb4bd5133f53e790a11916a8fa7e8d8b4","abstract_canon_sha256":"f8013699ce1dcf362539dfe56a5320f0a02ef953e61646b62a034feeb379b1db"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:05:45.027892Z","signature_b64":"gMWJAWuBao3P14J0gykAkD72lOPhewAzu9ENqIfr/LRds2gF8VMtQ6HRUa3QIlz/hToUfRsQG1KlKmf6RUTVDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"311cc85a78f627497406929a8db9b19bb18c7512b761ed3deb3009bd35349ff0","last_reissued_at":"2026-05-18T03:05:45.027323Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:05:45.027323Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Approximation Algorithms for Near-optimal Large-scale Network Monitoring","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"George Michailidis, Michael Kallitsis, Stilian Stoev","submitted_at":"2011-08-15T18:27:11Z","abstract_excerpt":"We study the problem of optimal traffic prediction and monitoring in large-scale networks. Our goal is to determine which subset of K links to monitor in order to \"best\" predict the traffic on the remaining links in the network. We consider several optimality criteria. This can be formulated as a combinatorial optimization problem, belonging to the family of subset selection problems. Similar NP-hard problems arise in statistics, machine learning and signal processing. Some include subset selection for regression, variable selection, and sparse approximation. Exact solutions are computationall"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.3048","kind":"arxiv","version":2},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1108.3048","created_at":"2026-05-18T03:05:45.027431+00:00"},{"alias_kind":"arxiv_version","alias_value":"1108.3048v2","created_at":"2026-05-18T03:05:45.027431+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.3048","created_at":"2026-05-18T03:05:45.027431+00:00"},{"alias_kind":"pith_short_12","alias_value":"GEOMQWTY6YTU","created_at":"2026-05-18T12:26:28.662955+00:00"},{"alias_kind":"pith_short_16","alias_value":"GEOMQWTY6YTUS5AG","created_at":"2026-05-18T12:26:28.662955+00:00"},{"alias_kind":"pith_short_8","alias_value":"GEOMQWTY","created_at":"2026-05-18T12:26:28.662955+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GEOMQWTY6YTUS5AGSKNI3ONRTO","json":"https://pith.science/pith/GEOMQWTY6YTUS5AGSKNI3ONRTO.json","graph_json":"https://pith.science/api/pith-number/GEOMQWTY6YTUS5AGSKNI3ONRTO/graph.json","events_json":"https://pith.science/api/pith-number/GEOMQWTY6YTUS5AGSKNI3ONRTO/events.json","paper":"https://pith.science/paper/GEOMQWTY"},"agent_actions":{"view_html":"https://pith.science/pith/GEOMQWTY6YTUS5AGSKNI3ONRTO","download_json":"https://pith.science/pith/GEOMQWTY6YTUS5AGSKNI3ONRTO.json","view_paper":"https://pith.science/paper/GEOMQWTY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1108.3048&json=true","fetch_graph":"https://pith.science/api/pith-number/GEOMQWTY6YTUS5AGSKNI3ONRTO/graph.json","fetch_events":"https://pith.science/api/pith-number/GEOMQWTY6YTUS5AGSKNI3ONRTO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GEOMQWTY6YTUS5AGSKNI3ONRTO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GEOMQWTY6YTUS5AGSKNI3ONRTO/action/storage_attestation","attest_author":"https://pith.science/pith/GEOMQWTY6YTUS5AGSKNI3ONRTO/action/author_attestation","sign_citation":"https://pith.science/pith/GEOMQWTY6YTUS5AGSKNI3ONRTO/action/citation_signature","submit_replication":"https://pith.science/pith/GEOMQWTY6YTUS5AGSKNI3ONRTO/action/replication_record"}},"created_at":"2026-05-18T03:05:45.027431+00:00","updated_at":"2026-05-18T03:05:45.027431+00:00"}