{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:PUDKSLZUZCM6FSY43G4RV3TAFH","short_pith_number":"pith:PUDKSLZU","canonical_record":{"source":{"id":"1410.5303","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2014-10-20T14:55:58Z","cross_cats_sorted":["math.NA","physics.soc-ph"],"title_canon_sha256":"1ad72486fa5fe9e2355bfc28d658a0b42868cd4918b23dffe77b1cc84c891dc4","abstract_canon_sha256":"b3647ac7814d1f30ae5c885d91050c0ede525165124b3a7c1a06bdf56487a2e5"},"schema_version":"1.0"},"canonical_sha256":"7d06a92f34c899e2cb1cd9b91aee6029c48134b3010181faded8874c5a44f7e2","source":{"kind":"arxiv","id":"1410.5303","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.5303","created_at":"2026-05-18T01:35:00Z"},{"alias_kind":"arxiv_version","alias_value":"1410.5303v4","created_at":"2026-05-18T01:35:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.5303","created_at":"2026-05-18T01:35:00Z"},{"alias_kind":"pith_short_12","alias_value":"PUDKSLZUZCM6","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"PUDKSLZUZCM6FSY4","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"PUDKSLZU","created_at":"2026-05-18T12:28:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:PUDKSLZUZCM6FSY43G4RV3TAFH","target":"record","payload":{"canonical_record":{"source":{"id":"1410.5303","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2014-10-20T14:55:58Z","cross_cats_sorted":["math.NA","physics.soc-ph"],"title_canon_sha256":"1ad72486fa5fe9e2355bfc28d658a0b42868cd4918b23dffe77b1cc84c891dc4","abstract_canon_sha256":"b3647ac7814d1f30ae5c885d91050c0ede525165124b3a7c1a06bdf56487a2e5"},"schema_version":"1.0"},"canonical_sha256":"7d06a92f34c899e2cb1cd9b91aee6029c48134b3010181faded8874c5a44f7e2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:00.885585Z","signature_b64":"EXLt9e+F7XglOwzfPMu6bz5td3h7vjC0DGKjdp89QHfJZGuOHy+XTf9fdaOaWAPrOsxY9ACpJJ6/hOCJfIcJBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7d06a92f34c899e2cb1cd9b91aee6029c48134b3010181faded8874c5a44f7e2","last_reissued_at":"2026-05-18T01:35:00.884886Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:00.884886Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1410.5303","source_version":4,"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-18T01:35:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uX4ktGjkQasNdXdUO2Kz81K5Gu0Pz+T7dR5Uzz23VSvh1gB3/K6kMNswLrKVBnTBGepXTL5bnelWx+JNUN1EAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T03:00:50.507432Z"},"content_sha256":"cf987c1cde34973d3f06fd292930f5d04fe0225c438c70bf4cc7568112b697dc","schema_version":"1.0","event_id":"sha256:cf987c1cde34973d3f06fd292930f5d04fe0225c438c70bf4cc7568112b697dc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:PUDKSLZUZCM6FSY43G4RV3TAFH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Updating and downdating techniques for optimizing network communicability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NA","physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Francesca Arrigo, Michele Benzi","submitted_at":"2014-10-20T14:55:58Z","abstract_excerpt":"The total communicability of a network (or graph) is defined as the sum of the entries in the exponential of the adjacency matrix of the network, possibly normalized by the number of nodes. This quantity offers a good measure of how easily information spreads across the network, and can be useful in the design of networks having certain desirable properties. The total communicability can be computed quickly even for large networks using techniques based on the Lanczos algorithm.\n  In this work we introduce some heuristics that can be used to add, delete, or rewire a limited number of edges in "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.5303","kind":"arxiv","version":4},"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-18T01:35:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6fipPcpxXuMPZkZcHY8AakANADYj8mbNodzqVtG1K9fbU8ZVettr2HJi/GIa57uy3Fn9dvqz/YI1UkYHydPEBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T03:00:50.507808Z"},"content_sha256":"d47b319a92b531cb8a31f4c7dd49842a3bdd81f9e25535fd63e689fa0fe1bf80","schema_version":"1.0","event_id":"sha256:d47b319a92b531cb8a31f4c7dd49842a3bdd81f9e25535fd63e689fa0fe1bf80"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PUDKSLZUZCM6FSY43G4RV3TAFH/bundle.json","state_url":"https://pith.science/pith/PUDKSLZUZCM6FSY43G4RV3TAFH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PUDKSLZUZCM6FSY43G4RV3TAFH/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-23T03:00:50Z","links":{"resolver":"https://pith.science/pith/PUDKSLZUZCM6FSY43G4RV3TAFH","bundle":"https://pith.science/pith/PUDKSLZUZCM6FSY43G4RV3TAFH/bundle.json","state":"https://pith.science/pith/PUDKSLZUZCM6FSY43G4RV3TAFH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PUDKSLZUZCM6FSY43G4RV3TAFH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:PUDKSLZUZCM6FSY43G4RV3TAFH","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":"b3647ac7814d1f30ae5c885d91050c0ede525165124b3a7c1a06bdf56487a2e5","cross_cats_sorted":["math.NA","physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2014-10-20T14:55:58Z","title_canon_sha256":"1ad72486fa5fe9e2355bfc28d658a0b42868cd4918b23dffe77b1cc84c891dc4"},"schema_version":"1.0","source":{"id":"1410.5303","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.5303","created_at":"2026-05-18T01:35:00Z"},{"alias_kind":"arxiv_version","alias_value":"1410.5303v4","created_at":"2026-05-18T01:35:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.5303","created_at":"2026-05-18T01:35:00Z"},{"alias_kind":"pith_short_12","alias_value":"PUDKSLZUZCM6","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"PUDKSLZUZCM6FSY4","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"PUDKSLZU","created_at":"2026-05-18T12:28:43Z"}],"graph_snapshots":[{"event_id":"sha256:d47b319a92b531cb8a31f4c7dd49842a3bdd81f9e25535fd63e689fa0fe1bf80","target":"graph","created_at":"2026-05-18T01:35:00Z","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 total communicability of a network (or graph) is defined as the sum of the entries in the exponential of the adjacency matrix of the network, possibly normalized by the number of nodes. This quantity offers a good measure of how easily information spreads across the network, and can be useful in the design of networks having certain desirable properties. The total communicability can be computed quickly even for large networks using techniques based on the Lanczos algorithm.\n  In this work we introduce some heuristics that can be used to add, delete, or rewire a limited number of edges in ","authors_text":"Francesca Arrigo, Michele Benzi","cross_cats":["math.NA","physics.soc-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2014-10-20T14:55:58Z","title":"Updating and downdating techniques for optimizing network communicability"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.5303","kind":"arxiv","version":4},"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:cf987c1cde34973d3f06fd292930f5d04fe0225c438c70bf4cc7568112b697dc","target":"record","created_at":"2026-05-18T01:35:00Z","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":"b3647ac7814d1f30ae5c885d91050c0ede525165124b3a7c1a06bdf56487a2e5","cross_cats_sorted":["math.NA","physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2014-10-20T14:55:58Z","title_canon_sha256":"1ad72486fa5fe9e2355bfc28d658a0b42868cd4918b23dffe77b1cc84c891dc4"},"schema_version":"1.0","source":{"id":"1410.5303","kind":"arxiv","version":4}},"canonical_sha256":"7d06a92f34c899e2cb1cd9b91aee6029c48134b3010181faded8874c5a44f7e2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7d06a92f34c899e2cb1cd9b91aee6029c48134b3010181faded8874c5a44f7e2","first_computed_at":"2026-05-18T01:35:00.884886Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:35:00.884886Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EXLt9e+F7XglOwzfPMu6bz5td3h7vjC0DGKjdp89QHfJZGuOHy+XTf9fdaOaWAPrOsxY9ACpJJ6/hOCJfIcJBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:35:00.885585Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.5303","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cf987c1cde34973d3f06fd292930f5d04fe0225c438c70bf4cc7568112b697dc","sha256:d47b319a92b531cb8a31f4c7dd49842a3bdd81f9e25535fd63e689fa0fe1bf80"],"state_sha256":"751fb4bac69b5b4e64c3ce4ca4de64a9ce5119ad34b589409d2809d0e0cb8309"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C91JdiFV4S/w4xZ0ERsSCqUHedrDCAbW87f6mA9OjakAUPeAYDWpBatLgV034tso71PwR9Vv0N5KDM42UUUNBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T03:00:50.509957Z","bundle_sha256":"c6f63cf84e5175b1e01c17044430579387472967512eaa1a68e26197a61ebd34"}}