{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:6J3W6KP7MJLXDGZ3UZH6FZQAZB","short_pith_number":"pith:6J3W6KP7","canonical_record":{"source":{"id":"1405.7231","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.data-an","submitted_at":"2014-05-28T13:42:41Z","cross_cats_sorted":[],"title_canon_sha256":"20475248d89077857188fc5ab5abe3251d9721b279ecf89a9f6fd0cdeef9faa8","abstract_canon_sha256":"49d67eb55c8b53c6526bcc13333c8f3dfa1f1956916aed0807e9d54e3f9c5774"},"schema_version":"1.0"},"canonical_sha256":"f2776f29ff6257719b3ba64fe2e600c854747323cfb7a72c0b73f100dff8efe1","source":{"kind":"arxiv","id":"1405.7231","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.7231","created_at":"2026-05-18T02:50:58Z"},{"alias_kind":"arxiv_version","alias_value":"1405.7231v1","created_at":"2026-05-18T02:50:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.7231","created_at":"2026-05-18T02:50:58Z"},{"alias_kind":"pith_short_12","alias_value":"6J3W6KP7MJLX","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"6J3W6KP7MJLXDGZ3","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"6J3W6KP7","created_at":"2026-05-18T12:28:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:6J3W6KP7MJLXDGZ3UZH6FZQAZB","target":"record","payload":{"canonical_record":{"source":{"id":"1405.7231","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.data-an","submitted_at":"2014-05-28T13:42:41Z","cross_cats_sorted":[],"title_canon_sha256":"20475248d89077857188fc5ab5abe3251d9721b279ecf89a9f6fd0cdeef9faa8","abstract_canon_sha256":"49d67eb55c8b53c6526bcc13333c8f3dfa1f1956916aed0807e9d54e3f9c5774"},"schema_version":"1.0"},"canonical_sha256":"f2776f29ff6257719b3ba64fe2e600c854747323cfb7a72c0b73f100dff8efe1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:50:58.336032Z","signature_b64":"WYLK0z1C4daXB1pCEYRH4/kNdxSePFakVTy2eyMItkpEVd1Y0A0LDq4Z90Op/5wlIZBA+7RCdtt+37wfOCEyAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f2776f29ff6257719b3ba64fe2e600c854747323cfb7a72c0b73f100dff8efe1","last_reissued_at":"2026-05-18T02:50:58.335183Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:50:58.335183Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1405.7231","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:50:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Gw/iwW/pR0t4iI8xS43glLm9fegVC2MqD2Gr6t25hSIIz3zN1o2SmgZwkXPraHHD+pleAl8BEEtnlE3kuB16Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T16:22:53.111023Z"},"content_sha256":"31ded13fb82c18053462e60cb954361e9cf825fdc63a275c17be5a59a2f646b8","schema_version":"1.0","event_id":"sha256:31ded13fb82c18053462e60cb954361e9cf825fdc63a275c17be5a59a2f646b8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:6J3W6KP7MJLXDGZ3UZH6FZQAZB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Longest-path attacks on complex networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"physics.data-an","authors_text":"Cunlai Pu, Wei Cui","submitted_at":"2014-05-28T13:42:41Z","abstract_excerpt":"We investigate the longest-path attacks on complex networks. Specifically, we remove approximately the longest simple path from a network iteratively until there are no paths left in the network. We propose two algorithms, the random augmenting approach (RPA) and the Hamilton-path based approach (HPA), for finding the approximately longest simple path in a network. Results demonstrate that steps of longest-path attacks increase with network density linearly for random networks, while exponentially increasing for scale-free networks. The more homogeneous the degree distribution is, the more fra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.7231","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:50:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ug4ir5dnaBxdckYhSfsiCAL9fQACZKOS+ivfdposnzEDrBmlxwI0Uv6CSKBrM/vyd216OCGWAYXgkbNWxkKyDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T16:22:53.111711Z"},"content_sha256":"70a9c9a42660492d2230d67281d81491799e180d61d622d5e50f41cb2f6ced53","schema_version":"1.0","event_id":"sha256:70a9c9a42660492d2230d67281d81491799e180d61d622d5e50f41cb2f6ced53"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6J3W6KP7MJLXDGZ3UZH6FZQAZB/bundle.json","state_url":"https://pith.science/pith/6J3W6KP7MJLXDGZ3UZH6FZQAZB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6J3W6KP7MJLXDGZ3UZH6FZQAZB/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-10T16:22:53Z","links":{"resolver":"https://pith.science/pith/6J3W6KP7MJLXDGZ3UZH6FZQAZB","bundle":"https://pith.science/pith/6J3W6KP7MJLXDGZ3UZH6FZQAZB/bundle.json","state":"https://pith.science/pith/6J3W6KP7MJLXDGZ3UZH6FZQAZB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6J3W6KP7MJLXDGZ3UZH6FZQAZB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:6J3W6KP7MJLXDGZ3UZH6FZQAZB","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":"49d67eb55c8b53c6526bcc13333c8f3dfa1f1956916aed0807e9d54e3f9c5774","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.data-an","submitted_at":"2014-05-28T13:42:41Z","title_canon_sha256":"20475248d89077857188fc5ab5abe3251d9721b279ecf89a9f6fd0cdeef9faa8"},"schema_version":"1.0","source":{"id":"1405.7231","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.7231","created_at":"2026-05-18T02:50:58Z"},{"alias_kind":"arxiv_version","alias_value":"1405.7231v1","created_at":"2026-05-18T02:50:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.7231","created_at":"2026-05-18T02:50:58Z"},{"alias_kind":"pith_short_12","alias_value":"6J3W6KP7MJLX","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"6J3W6KP7MJLXDGZ3","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"6J3W6KP7","created_at":"2026-05-18T12:28:16Z"}],"graph_snapshots":[{"event_id":"sha256:70a9c9a42660492d2230d67281d81491799e180d61d622d5e50f41cb2f6ced53","target":"graph","created_at":"2026-05-18T02:50:58Z","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 investigate the longest-path attacks on complex networks. Specifically, we remove approximately the longest simple path from a network iteratively until there are no paths left in the network. We propose two algorithms, the random augmenting approach (RPA) and the Hamilton-path based approach (HPA), for finding the approximately longest simple path in a network. Results demonstrate that steps of longest-path attacks increase with network density linearly for random networks, while exponentially increasing for scale-free networks. The more homogeneous the degree distribution is, the more fra","authors_text":"Cunlai Pu, Wei Cui","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.data-an","submitted_at":"2014-05-28T13:42:41Z","title":"Longest-path attacks on complex networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.7231","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:31ded13fb82c18053462e60cb954361e9cf825fdc63a275c17be5a59a2f646b8","target":"record","created_at":"2026-05-18T02:50:58Z","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":"49d67eb55c8b53c6526bcc13333c8f3dfa1f1956916aed0807e9d54e3f9c5774","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.data-an","submitted_at":"2014-05-28T13:42:41Z","title_canon_sha256":"20475248d89077857188fc5ab5abe3251d9721b279ecf89a9f6fd0cdeef9faa8"},"schema_version":"1.0","source":{"id":"1405.7231","kind":"arxiv","version":1}},"canonical_sha256":"f2776f29ff6257719b3ba64fe2e600c854747323cfb7a72c0b73f100dff8efe1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f2776f29ff6257719b3ba64fe2e600c854747323cfb7a72c0b73f100dff8efe1","first_computed_at":"2026-05-18T02:50:58.335183Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:50:58.335183Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WYLK0z1C4daXB1pCEYRH4/kNdxSePFakVTy2eyMItkpEVd1Y0A0LDq4Z90Op/5wlIZBA+7RCdtt+37wfOCEyAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:50:58.336032Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.7231","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:31ded13fb82c18053462e60cb954361e9cf825fdc63a275c17be5a59a2f646b8","sha256:70a9c9a42660492d2230d67281d81491799e180d61d622d5e50f41cb2f6ced53"],"state_sha256":"8bad85cabb0839539efe8ece61b1c6bf1abcff76f52e12baacd2589b769954b0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pc4KU4+A1+76lT5w2wT/ZbgQNB36oDvZ26LeB+PPhDgYZGHKLy4hQasjXlNrZ6juKm99+/wo5dAzRT6eDImpAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T16:22:53.115623Z","bundle_sha256":"8b6fd9959d94c0627e520241e68bd65b9f9d947e48e335a2a82ed7d280d00760"}}