{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:GEOMQWTY6YTUS5AGSKNI3ONRTO","short_pith_number":"pith:GEOMQWTY","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"},"canonical_sha256":"311cc85a78f627497406929a8db9b19bb18c7512b761ed3deb3009bd35349ff0","source":{"kind":"arxiv","id":"1108.3048","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.3048","created_at":"2026-05-18T03:05:45Z"},{"alias_kind":"arxiv_version","alias_value":"1108.3048v2","created_at":"2026-05-18T03:05:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.3048","created_at":"2026-05-18T03:05:45Z"},{"alias_kind":"pith_short_12","alias_value":"GEOMQWTY6YTU","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_16","alias_value":"GEOMQWTY6YTUS5AG","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_8","alias_value":"GEOMQWTY","created_at":"2026-05-18T12:26:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:GEOMQWTY6YTUS5AGSKNI3ONRTO","target":"record","payload":{"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"},"canonical_sha256":"311cc85a78f627497406929a8db9b19bb18c7512b761ed3deb3009bd35349ff0","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"},"source_kind":"arxiv","source_id":"1108.3048","source_version":2,"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-18T03:05:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IZ6igt9XOOCEvWeyr9R33uptSk4Vb/TdaRbig7UjzhXK/2A6AamkD59b+ftIuW6m9uGt4al8q85FIDm1gmHnBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T12:11:11.705716Z"},"content_sha256":"6f95b3cdf20742ed852c2703f385230870f9a135c2253f030354bbb7edd2f9fa","schema_version":"1.0","event_id":"sha256:6f95b3cdf20742ed852c2703f385230870f9a135c2253f030354bbb7edd2f9fa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:GEOMQWTY6YTUS5AGSKNI3ONRTO","target":"graph","payload":{"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"},"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-18T03:05:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oYQKOEKgzKg+BSi3W2YWVv7WcY+3cfBaU08b63MBWde2hVQAGj6GKU+iNGcJxzpF6nmiIgQ3f0i6vy5oCL3yAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T12:11:11.706054Z"},"content_sha256":"17ad4eb2908e0508ae5fbb8f04c74b6aa4f9c0e8164e88c797dbbdbf0d96693e","schema_version":"1.0","event_id":"sha256:17ad4eb2908e0508ae5fbb8f04c74b6aa4f9c0e8164e88c797dbbdbf0d96693e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GEOMQWTY6YTUS5AGSKNI3ONRTO/bundle.json","state_url":"https://pith.science/pith/GEOMQWTY6YTUS5AGSKNI3ONRTO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GEOMQWTY6YTUS5AGSKNI3ONRTO/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-28T12:11:11Z","links":{"resolver":"https://pith.science/pith/GEOMQWTY6YTUS5AGSKNI3ONRTO","bundle":"https://pith.science/pith/GEOMQWTY6YTUS5AGSKNI3ONRTO/bundle.json","state":"https://pith.science/pith/GEOMQWTY6YTUS5AGSKNI3ONRTO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GEOMQWTY6YTUS5AGSKNI3ONRTO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:GEOMQWTY6YTUS5AGSKNI3ONRTO","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":"f8013699ce1dcf362539dfe56a5320f0a02ef953e61646b62a034feeb379b1db","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-08-15T18:27:11Z","title_canon_sha256":"81c775328f2ae7399eba1511b3dd525fb4bd5133f53e790a11916a8fa7e8d8b4"},"schema_version":"1.0","source":{"id":"1108.3048","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.3048","created_at":"2026-05-18T03:05:45Z"},{"alias_kind":"arxiv_version","alias_value":"1108.3048v2","created_at":"2026-05-18T03:05:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.3048","created_at":"2026-05-18T03:05:45Z"},{"alias_kind":"pith_short_12","alias_value":"GEOMQWTY6YTU","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_16","alias_value":"GEOMQWTY6YTUS5AG","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_8","alias_value":"GEOMQWTY","created_at":"2026-05-18T12:26:28Z"}],"graph_snapshots":[{"event_id":"sha256:17ad4eb2908e0508ae5fbb8f04c74b6aa4f9c0e8164e88c797dbbdbf0d96693e","target":"graph","created_at":"2026-05-18T03:05:45Z","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 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","authors_text":"George Michailidis, Michael Kallitsis, Stilian Stoev","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-08-15T18:27:11Z","title":"Fast Approximation Algorithms for Near-optimal Large-scale Network Monitoring"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.3048","kind":"arxiv","version":2},"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:6f95b3cdf20742ed852c2703f385230870f9a135c2253f030354bbb7edd2f9fa","target":"record","created_at":"2026-05-18T03:05:45Z","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":"f8013699ce1dcf362539dfe56a5320f0a02ef953e61646b62a034feeb379b1db","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-08-15T18:27:11Z","title_canon_sha256":"81c775328f2ae7399eba1511b3dd525fb4bd5133f53e790a11916a8fa7e8d8b4"},"schema_version":"1.0","source":{"id":"1108.3048","kind":"arxiv","version":2}},"canonical_sha256":"311cc85a78f627497406929a8db9b19bb18c7512b761ed3deb3009bd35349ff0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"311cc85a78f627497406929a8db9b19bb18c7512b761ed3deb3009bd35349ff0","first_computed_at":"2026-05-18T03:05:45.027323Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:05:45.027323Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gMWJAWuBao3P14J0gykAkD72lOPhewAzu9ENqIfr/LRds2gF8VMtQ6HRUa3QIlz/hToUfRsQG1KlKmf6RUTVDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:05:45.027892Z","signed_message":"canonical_sha256_bytes"},"source_id":"1108.3048","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6f95b3cdf20742ed852c2703f385230870f9a135c2253f030354bbb7edd2f9fa","sha256:17ad4eb2908e0508ae5fbb8f04c74b6aa4f9c0e8164e88c797dbbdbf0d96693e"],"state_sha256":"073710a00fa1675754607b6a319eec4dd0f5746d0c05f6415446eebe3e41f537"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0FXQfonvQANbSvySscO8muo1haeoBj7biTG7HUac0eArN93stGj1bJ/Lj8aj2Rr0e2Yp42C9ug58os/i9LiDDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T12:11:11.707979Z","bundle_sha256":"48c6369559289097689d38bfc3ceeb2e64e665d05cef18442ede7fdd98cd0520"}}