{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:OJKPZWVQ2FQE35CJ42YTORUI3Q","short_pith_number":"pith:OJKPZWVQ","canonical_record":{"source":{"id":"1104.2156","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-04-12T09:57:05Z","cross_cats_sorted":["cs.IT","cs.PF","math.IT"],"title_canon_sha256":"1d5ee6e5c68817fa0b07039967500ea3bfb3861b7ee626dcea1211db0e7ff1bf","abstract_canon_sha256":"3e1a00eb74344cbd32ea6349227df1e8d47a516853609345d14e0f6591c75d8f"},"schema_version":"1.0"},"canonical_sha256":"7254fcdab0d1604df449e6b1374688dc0e081c5c386cb360c6c59842f1717822","source":{"kind":"arxiv","id":"1104.2156","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.2156","created_at":"2026-05-18T02:22:09Z"},{"alias_kind":"arxiv_version","alias_value":"1104.2156v2","created_at":"2026-05-18T02:22:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.2156","created_at":"2026-05-18T02:22:09Z"},{"alias_kind":"pith_short_12","alias_value":"OJKPZWVQ2FQE","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"OJKPZWVQ2FQE35CJ","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"OJKPZWVQ","created_at":"2026-05-18T12:26:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:OJKPZWVQ2FQE35CJ42YTORUI3Q","target":"record","payload":{"canonical_record":{"source":{"id":"1104.2156","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-04-12T09:57:05Z","cross_cats_sorted":["cs.IT","cs.PF","math.IT"],"title_canon_sha256":"1d5ee6e5c68817fa0b07039967500ea3bfb3861b7ee626dcea1211db0e7ff1bf","abstract_canon_sha256":"3e1a00eb74344cbd32ea6349227df1e8d47a516853609345d14e0f6591c75d8f"},"schema_version":"1.0"},"canonical_sha256":"7254fcdab0d1604df449e6b1374688dc0e081c5c386cb360c6c59842f1717822","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:22:09.782361Z","signature_b64":"vu4SPLmKTHNPeywTsHlgz9sLYjhlqixKn57gIiv4W1bP6xFQvhcoHgFxqXtN5yt5XiFwPaewZThf+NPWHS56Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7254fcdab0d1604df449e6b1374688dc0e081c5c386cb360c6c59842f1717822","last_reissued_at":"2026-05-18T02:22:09.781675Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:22:09.781675Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1104.2156","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-18T02:22:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H04IMS1QBIn6hKx1qmg5kkoTRUsFVnY+qZ5+VuIOquY9+sO43W+Fi7G+4egSccVJnF84wNdeam/PZYdpVnL1Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T05:22:53.766349Z"},"content_sha256":"a3c4cfecd2053fd3d7bc55bfa8e4037506ea5f6237d1fa77ae0409ead82eb781","schema_version":"1.0","event_id":"sha256:a3c4cfecd2053fd3d7bc55bfa8e4037506ea5f6237d1fa77ae0409ead82eb781"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:OJKPZWVQ2FQE35CJ42YTORUI3Q","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Structural Analysis of Network Traffic Matrix via Relaxed Principal Component Pursuit","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.PF","math.IT"],"primary_cat":"cs.NI","authors_text":"Baolin Yin, Kai Hu, Ke Xu, Xiaowen Dong, Zhe Wang","submitted_at":"2011-04-12T09:57:05Z","abstract_excerpt":"The network traffic matrix is widely used in network operation and management. It is therefore of crucial importance to analyze the components and the structure of the network traffic matrix, for which several mathematical approaches such as Principal Component Analysis (PCA) were proposed. In this paper, we first argue that PCA performs poorly for analyzing traffic matrix that is polluted by large volume anomalies, and then propose a new decomposition model for the network traffic matrix. According to this model, we carry out the structural analysis by decomposing the network traffic matrix i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.2156","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-18T02:22:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AT+mgsrcNjsv2P5znO7dv2Z1uxgbFHqGKDhNxAepgpJhDwyKXb6OEmCw1uOZlF89eDLnF8t831NRPxtNiByFBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T05:22:53.767050Z"},"content_sha256":"a47a3fd802bde726412fbc6d1c7f994bcb567166209cffe4a0c92e91dad67ac6","schema_version":"1.0","event_id":"sha256:a47a3fd802bde726412fbc6d1c7f994bcb567166209cffe4a0c92e91dad67ac6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OJKPZWVQ2FQE35CJ42YTORUI3Q/bundle.json","state_url":"https://pith.science/pith/OJKPZWVQ2FQE35CJ42YTORUI3Q/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OJKPZWVQ2FQE35CJ42YTORUI3Q/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-31T05:22:53Z","links":{"resolver":"https://pith.science/pith/OJKPZWVQ2FQE35CJ42YTORUI3Q","bundle":"https://pith.science/pith/OJKPZWVQ2FQE35CJ42YTORUI3Q/bundle.json","state":"https://pith.science/pith/OJKPZWVQ2FQE35CJ42YTORUI3Q/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OJKPZWVQ2FQE35CJ42YTORUI3Q/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:OJKPZWVQ2FQE35CJ42YTORUI3Q","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":"3e1a00eb74344cbd32ea6349227df1e8d47a516853609345d14e0f6591c75d8f","cross_cats_sorted":["cs.IT","cs.PF","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-04-12T09:57:05Z","title_canon_sha256":"1d5ee6e5c68817fa0b07039967500ea3bfb3861b7ee626dcea1211db0e7ff1bf"},"schema_version":"1.0","source":{"id":"1104.2156","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.2156","created_at":"2026-05-18T02:22:09Z"},{"alias_kind":"arxiv_version","alias_value":"1104.2156v2","created_at":"2026-05-18T02:22:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.2156","created_at":"2026-05-18T02:22:09Z"},{"alias_kind":"pith_short_12","alias_value":"OJKPZWVQ2FQE","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"OJKPZWVQ2FQE35CJ","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"OJKPZWVQ","created_at":"2026-05-18T12:26:37Z"}],"graph_snapshots":[{"event_id":"sha256:a47a3fd802bde726412fbc6d1c7f994bcb567166209cffe4a0c92e91dad67ac6","target":"graph","created_at":"2026-05-18T02:22:09Z","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 network traffic matrix is widely used in network operation and management. It is therefore of crucial importance to analyze the components and the structure of the network traffic matrix, for which several mathematical approaches such as Principal Component Analysis (PCA) were proposed. In this paper, we first argue that PCA performs poorly for analyzing traffic matrix that is polluted by large volume anomalies, and then propose a new decomposition model for the network traffic matrix. According to this model, we carry out the structural analysis by decomposing the network traffic matrix i","authors_text":"Baolin Yin, Kai Hu, Ke Xu, Xiaowen Dong, Zhe Wang","cross_cats":["cs.IT","cs.PF","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-04-12T09:57:05Z","title":"Structural Analysis of Network Traffic Matrix via Relaxed Principal Component Pursuit"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.2156","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:a3c4cfecd2053fd3d7bc55bfa8e4037506ea5f6237d1fa77ae0409ead82eb781","target":"record","created_at":"2026-05-18T02:22:09Z","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":"3e1a00eb74344cbd32ea6349227df1e8d47a516853609345d14e0f6591c75d8f","cross_cats_sorted":["cs.IT","cs.PF","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-04-12T09:57:05Z","title_canon_sha256":"1d5ee6e5c68817fa0b07039967500ea3bfb3861b7ee626dcea1211db0e7ff1bf"},"schema_version":"1.0","source":{"id":"1104.2156","kind":"arxiv","version":2}},"canonical_sha256":"7254fcdab0d1604df449e6b1374688dc0e081c5c386cb360c6c59842f1717822","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7254fcdab0d1604df449e6b1374688dc0e081c5c386cb360c6c59842f1717822","first_computed_at":"2026-05-18T02:22:09.781675Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:22:09.781675Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vu4SPLmKTHNPeywTsHlgz9sLYjhlqixKn57gIiv4W1bP6xFQvhcoHgFxqXtN5yt5XiFwPaewZThf+NPWHS56Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T02:22:09.782361Z","signed_message":"canonical_sha256_bytes"},"source_id":"1104.2156","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a3c4cfecd2053fd3d7bc55bfa8e4037506ea5f6237d1fa77ae0409ead82eb781","sha256:a47a3fd802bde726412fbc6d1c7f994bcb567166209cffe4a0c92e91dad67ac6"],"state_sha256":"d450f00cc0bc547cc815cda5152beff951cc89b3bffe1a229138a677186f6cea"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n5UOqrJoVWWMXDk6Gp9M1eZZBe2H6plFV9VP3xW4XCxOK/zSVLOxcMnBkdE9UNEQVY0xZjDmd4gls41uSLwrDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T05:22:53.770652Z","bundle_sha256":"53d3d3b9d989c81265e4f139a727c7c1288594d3088ec83f0b557fc21a256662"}}