{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:C57JTE5L42ICMHUI7KNASY4CND","short_pith_number":"pith:C57JTE5L","canonical_record":{"source":{"id":"1501.01939","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2015-01-08T19:54:03Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"ea96f7095acdae2e313b44214e510666f8948a5bb0ae74eb63f81510fe321c81","abstract_canon_sha256":"ad389f95440083fbadf4aa937bbebe14e8525418b22c981cde4d21146cf7efb3"},"schema_version":"1.0"},"canonical_sha256":"177e9993abe690261e88fa9a09638268d68611dea91d120496918ede314af143","source":{"kind":"arxiv","id":"1501.01939","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.01939","created_at":"2026-05-18T02:29:45Z"},{"alias_kind":"arxiv_version","alias_value":"1501.01939v1","created_at":"2026-05-18T02:29:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.01939","created_at":"2026-05-18T02:29:45Z"},{"alias_kind":"pith_short_12","alias_value":"C57JTE5L42IC","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"C57JTE5L42ICMHUI","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"C57JTE5L","created_at":"2026-05-18T12:29:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:C57JTE5L42ICMHUI7KNASY4CND","target":"record","payload":{"canonical_record":{"source":{"id":"1501.01939","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2015-01-08T19:54:03Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"ea96f7095acdae2e313b44214e510666f8948a5bb0ae74eb63f81510fe321c81","abstract_canon_sha256":"ad389f95440083fbadf4aa937bbebe14e8525418b22c981cde4d21146cf7efb3"},"schema_version":"1.0"},"canonical_sha256":"177e9993abe690261e88fa9a09638268d68611dea91d120496918ede314af143","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:29:45.963694Z","signature_b64":"tqO7tsQG78w5cD5cmZCEXtOIwtEs5qZd++v9aeefP4vOjzgpvx0QW/EQl5HkgG+BjsykCsF0NYwjPTxTTj4ECA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"177e9993abe690261e88fa9a09638268d68611dea91d120496918ede314af143","last_reissued_at":"2026-05-18T02:29:45.963297Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:29:45.963297Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1501.01939","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:29:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JidUKcS+OUiaXCTeKpIO69e6td/GYYWAzyy+WagTE1xfn9T6CqDUbInl68PcE0nTFj+2Ca3heAF3Tc6bnDPvDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T13:10:50.209694Z"},"content_sha256":"259a8443d3dade2a22101bd4615addd1f928e79f5d12e1bfb14fb84c89311c1a","schema_version":"1.0","event_id":"sha256:259a8443d3dade2a22101bd4615addd1f928e79f5d12e1bfb14fb84c89311c1a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:C57JTE5L42ICMHUI7KNASY4CND","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Where Graph Topology Matters: The Robust Subgraph Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.SI","authors_text":"Hau Chan, Leman Akoglu, Shuchu Han","submitted_at":"2015-01-08T19:54:03Z","abstract_excerpt":"Robustness is a critical measure of the resilience of large networked systems, such as transportation and communication networks. Most prior works focus on the global robustness of a given graph at large, e.g., by measuring its overall vulnerability to external attacks or random failures. In this paper, we turn attention to local robustness and pose a novel problem in the lines of subgraph mining: given a large graph, how can we find its most robust local subgraph (RLS)?\n  We define a robust subgraph as a subset of nodes with high communicability among them, and formulate the RLS-PROBLEM of fi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.01939","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:29:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oCRajAsbcH9sawFmuUcCODPUXXp2o1ZjsMLJvEO/6RDGFG5iLzpTpdgKHDw9a0LCmgr4wXMkIaOuPd4DNTU9Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T13:10:50.210041Z"},"content_sha256":"cf0ea0c7268428ce430cba10cfa0f1084bc80c0f8bf41475941a362ccc75b996","schema_version":"1.0","event_id":"sha256:cf0ea0c7268428ce430cba10cfa0f1084bc80c0f8bf41475941a362ccc75b996"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C57JTE5L42ICMHUI7KNASY4CND/bundle.json","state_url":"https://pith.science/pith/C57JTE5L42ICMHUI7KNASY4CND/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C57JTE5L42ICMHUI7KNASY4CND/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-02T13:10:50Z","links":{"resolver":"https://pith.science/pith/C57JTE5L42ICMHUI7KNASY4CND","bundle":"https://pith.science/pith/C57JTE5L42ICMHUI7KNASY4CND/bundle.json","state":"https://pith.science/pith/C57JTE5L42ICMHUI7KNASY4CND/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C57JTE5L42ICMHUI7KNASY4CND/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:C57JTE5L42ICMHUI7KNASY4CND","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":"ad389f95440083fbadf4aa937bbebe14e8525418b22c981cde4d21146cf7efb3","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2015-01-08T19:54:03Z","title_canon_sha256":"ea96f7095acdae2e313b44214e510666f8948a5bb0ae74eb63f81510fe321c81"},"schema_version":"1.0","source":{"id":"1501.01939","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.01939","created_at":"2026-05-18T02:29:45Z"},{"alias_kind":"arxiv_version","alias_value":"1501.01939v1","created_at":"2026-05-18T02:29:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.01939","created_at":"2026-05-18T02:29:45Z"},{"alias_kind":"pith_short_12","alias_value":"C57JTE5L42IC","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"C57JTE5L42ICMHUI","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"C57JTE5L","created_at":"2026-05-18T12:29:14Z"}],"graph_snapshots":[{"event_id":"sha256:cf0ea0c7268428ce430cba10cfa0f1084bc80c0f8bf41475941a362ccc75b996","target":"graph","created_at":"2026-05-18T02:29: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":"Robustness is a critical measure of the resilience of large networked systems, such as transportation and communication networks. Most prior works focus on the global robustness of a given graph at large, e.g., by measuring its overall vulnerability to external attacks or random failures. In this paper, we turn attention to local robustness and pose a novel problem in the lines of subgraph mining: given a large graph, how can we find its most robust local subgraph (RLS)?\n  We define a robust subgraph as a subset of nodes with high communicability among them, and formulate the RLS-PROBLEM of fi","authors_text":"Hau Chan, Leman Akoglu, Shuchu Han","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2015-01-08T19:54:03Z","title":"Where Graph Topology Matters: The Robust Subgraph Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.01939","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:259a8443d3dade2a22101bd4615addd1f928e79f5d12e1bfb14fb84c89311c1a","target":"record","created_at":"2026-05-18T02:29: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":"ad389f95440083fbadf4aa937bbebe14e8525418b22c981cde4d21146cf7efb3","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2015-01-08T19:54:03Z","title_canon_sha256":"ea96f7095acdae2e313b44214e510666f8948a5bb0ae74eb63f81510fe321c81"},"schema_version":"1.0","source":{"id":"1501.01939","kind":"arxiv","version":1}},"canonical_sha256":"177e9993abe690261e88fa9a09638268d68611dea91d120496918ede314af143","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"177e9993abe690261e88fa9a09638268d68611dea91d120496918ede314af143","first_computed_at":"2026-05-18T02:29:45.963297Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:29:45.963297Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tqO7tsQG78w5cD5cmZCEXtOIwtEs5qZd++v9aeefP4vOjzgpvx0QW/EQl5HkgG+BjsykCsF0NYwjPTxTTj4ECA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:29:45.963694Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.01939","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:259a8443d3dade2a22101bd4615addd1f928e79f5d12e1bfb14fb84c89311c1a","sha256:cf0ea0c7268428ce430cba10cfa0f1084bc80c0f8bf41475941a362ccc75b996"],"state_sha256":"8e83bbcef61f29827cf801b52a0ecd28a99d206eb461c955397d9a079bf7abb9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qS1w6+YjXb2ClFI7Q5CWKjcsM4hH/3inkgI2nPcSWyWtXYjlPMVBqMeCtrYhmZ3FaYM2sWWOFFAf7VYHRhYXAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T13:10:50.212273Z","bundle_sha256":"9d6b3d1d838616e1ad36e28aa425058d40869b551f74895bd35ff5231330313e"}}