{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:3C2Y4HO6KY6TD7DLJZQDVZRGNF","short_pith_number":"pith:3C2Y4HO6","canonical_record":{"source":{"id":"1303.0422","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-03-02T19:49:32Z","cross_cats_sorted":[],"title_canon_sha256":"be4404893ab02d1f1b783346b7c0aa9ee964de9674ee35a27b8346ff5926b0ed","abstract_canon_sha256":"d40081e451f8b9be118908455c1b5fcf08f55b3c4cc7d987e7941925bfe020aa"},"schema_version":"1.0"},"canonical_sha256":"d8b58e1dde563d31fc6b4e603ae6266946d4bccea14e51cfaf9112ff6bd82888","source":{"kind":"arxiv","id":"1303.0422","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.0422","created_at":"2026-05-18T03:31:56Z"},{"alias_kind":"arxiv_version","alias_value":"1303.0422v1","created_at":"2026-05-18T03:31:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.0422","created_at":"2026-05-18T03:31:56Z"},{"alias_kind":"pith_short_12","alias_value":"3C2Y4HO6KY6T","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"3C2Y4HO6KY6TD7DL","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"3C2Y4HO6","created_at":"2026-05-18T12:27:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:3C2Y4HO6KY6TD7DLJZQDVZRGNF","target":"record","payload":{"canonical_record":{"source":{"id":"1303.0422","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-03-02T19:49:32Z","cross_cats_sorted":[],"title_canon_sha256":"be4404893ab02d1f1b783346b7c0aa9ee964de9674ee35a27b8346ff5926b0ed","abstract_canon_sha256":"d40081e451f8b9be118908455c1b5fcf08f55b3c4cc7d987e7941925bfe020aa"},"schema_version":"1.0"},"canonical_sha256":"d8b58e1dde563d31fc6b4e603ae6266946d4bccea14e51cfaf9112ff6bd82888","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:31:56.135662Z","signature_b64":"jCPb2qRss3yK/9Soj34wM2/XMevA0TamIqC3ojtveOvHicnP4SwgoJC5vttdbpi6hyow6CMqc4kxDl86peN1Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d8b58e1dde563d31fc6b4e603ae6266946d4bccea14e51cfaf9112ff6bd82888","last_reissued_at":"2026-05-18T03:31:56.134941Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:31:56.134941Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1303.0422","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-18T03:31:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0HBq1IuYQYxqZhtUhcx9kI6efwEQVSOPMzctalOvJri5UyQz5BmD2TEJqQJFhJyml05gJd3anOdwgZFv8nsqBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T00:45:38.916950Z"},"content_sha256":"48cf6fad3745893c6b39b6038aa1c4a08b53d2a725676e2760fe2c395a6c996e","schema_version":"1.0","event_id":"sha256:48cf6fad3745893c6b39b6038aa1c4a08b53d2a725676e2760fe2c395a6c996e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:3C2Y4HO6KY6TD7DLJZQDVZRGNF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Incremental Algorithms for Network Management and Analysis based on Closeness Centrality","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ahmet Erdem Sariyuce, Erik Saule, Kamer Kaya, Umit V. Catalyurek","submitted_at":"2013-03-02T19:49:32Z","abstract_excerpt":"Analyzing networks requires complex algorithms to extract meaningful information. Centrality metrics have shown to be correlated with the importance and loads of the nodes in network traffic. Here, we are interested in the problem of centrality-based network management. The problem has many applications such as verifying the robustness of the networks and controlling or improving the entity dissemination. It can be defined as finding a small set of topological network modifications which yield a desired closeness centrality configuration. As a fundamental building block to tackle that problem,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.0422","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-18T03:31:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KUJHAzZNRUu3NEKt0enLkY/t8mgYd/cvIk+vnk4GlLPay/8GuICZZArhMeK30yc2YErrV+JrVMnIF3IO0aFuAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T00:45:38.917668Z"},"content_sha256":"22f5ae14efeda3bae53880d3f1a15d4f6e7d6f30a97a1ffb9297e60febce32cc","schema_version":"1.0","event_id":"sha256:22f5ae14efeda3bae53880d3f1a15d4f6e7d6f30a97a1ffb9297e60febce32cc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3C2Y4HO6KY6TD7DLJZQDVZRGNF/bundle.json","state_url":"https://pith.science/pith/3C2Y4HO6KY6TD7DLJZQDVZRGNF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3C2Y4HO6KY6TD7DLJZQDVZRGNF/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-26T00:45:38Z","links":{"resolver":"https://pith.science/pith/3C2Y4HO6KY6TD7DLJZQDVZRGNF","bundle":"https://pith.science/pith/3C2Y4HO6KY6TD7DLJZQDVZRGNF/bundle.json","state":"https://pith.science/pith/3C2Y4HO6KY6TD7DLJZQDVZRGNF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3C2Y4HO6KY6TD7DLJZQDVZRGNF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:3C2Y4HO6KY6TD7DLJZQDVZRGNF","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":"d40081e451f8b9be118908455c1b5fcf08f55b3c4cc7d987e7941925bfe020aa","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-03-02T19:49:32Z","title_canon_sha256":"be4404893ab02d1f1b783346b7c0aa9ee964de9674ee35a27b8346ff5926b0ed"},"schema_version":"1.0","source":{"id":"1303.0422","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.0422","created_at":"2026-05-18T03:31:56Z"},{"alias_kind":"arxiv_version","alias_value":"1303.0422v1","created_at":"2026-05-18T03:31:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.0422","created_at":"2026-05-18T03:31:56Z"},{"alias_kind":"pith_short_12","alias_value":"3C2Y4HO6KY6T","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"3C2Y4HO6KY6TD7DL","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"3C2Y4HO6","created_at":"2026-05-18T12:27:32Z"}],"graph_snapshots":[{"event_id":"sha256:22f5ae14efeda3bae53880d3f1a15d4f6e7d6f30a97a1ffb9297e60febce32cc","target":"graph","created_at":"2026-05-18T03:31:56Z","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":"Analyzing networks requires complex algorithms to extract meaningful information. Centrality metrics have shown to be correlated with the importance and loads of the nodes in network traffic. Here, we are interested in the problem of centrality-based network management. The problem has many applications such as verifying the robustness of the networks and controlling or improving the entity dissemination. It can be defined as finding a small set of topological network modifications which yield a desired closeness centrality configuration. As a fundamental building block to tackle that problem,","authors_text":"Ahmet Erdem Sariyuce, Erik Saule, Kamer Kaya, Umit V. Catalyurek","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-03-02T19:49:32Z","title":"Incremental Algorithms for Network Management and Analysis based on Closeness Centrality"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.0422","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:48cf6fad3745893c6b39b6038aa1c4a08b53d2a725676e2760fe2c395a6c996e","target":"record","created_at":"2026-05-18T03:31:56Z","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":"d40081e451f8b9be118908455c1b5fcf08f55b3c4cc7d987e7941925bfe020aa","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-03-02T19:49:32Z","title_canon_sha256":"be4404893ab02d1f1b783346b7c0aa9ee964de9674ee35a27b8346ff5926b0ed"},"schema_version":"1.0","source":{"id":"1303.0422","kind":"arxiv","version":1}},"canonical_sha256":"d8b58e1dde563d31fc6b4e603ae6266946d4bccea14e51cfaf9112ff6bd82888","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d8b58e1dde563d31fc6b4e603ae6266946d4bccea14e51cfaf9112ff6bd82888","first_computed_at":"2026-05-18T03:31:56.134941Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:31:56.134941Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jCPb2qRss3yK/9Soj34wM2/XMevA0TamIqC3ojtveOvHicnP4SwgoJC5vttdbpi6hyow6CMqc4kxDl86peN1Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:31:56.135662Z","signed_message":"canonical_sha256_bytes"},"source_id":"1303.0422","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:48cf6fad3745893c6b39b6038aa1c4a08b53d2a725676e2760fe2c395a6c996e","sha256:22f5ae14efeda3bae53880d3f1a15d4f6e7d6f30a97a1ffb9297e60febce32cc"],"state_sha256":"b153733e66cd1a68cc6132807c9797c467c72c15c64039d6e5f8cb963f5e0f4c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bK0V63ary7n2gDSe8W2aLyB0WncFZ4oqzs88JC+3+8ESzA6Ft6KC89bcaq0S4o/eQnczz67NaDeIwglbg74PBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T00:45:38.921619Z","bundle_sha256":"1936fd4de9bb5acee536c4eb111fdf24a0aef6adf67dd5c9e6b3797b01fe15d9"}}