{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:464LOZGVIB2XDNJX6BVRKHEFWF","short_pith_number":"pith:464LOZGV","canonical_record":{"source":{"id":"1803.08541","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"q-bio.NC","submitted_at":"2018-03-22T18:46:21Z","cross_cats_sorted":[],"title_canon_sha256":"25d58f92552100309cf291c1a266d540ddfde8ec4b93323d0319795023b04123","abstract_canon_sha256":"5292dd761ba59e45d10dc3741c8240658e3f857deb08de22819c692055c0fc28"},"schema_version":"1.0"},"canonical_sha256":"e7b8b764d5407571b537f06b151c85b17426a122267c8cf5bff0e11478cde44f","source":{"kind":"arxiv","id":"1803.08541","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.08541","created_at":"2026-05-17T23:43:07Z"},{"alias_kind":"arxiv_version","alias_value":"1803.08541v1","created_at":"2026-05-17T23:43:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.08541","created_at":"2026-05-17T23:43:07Z"},{"alias_kind":"pith_short_12","alias_value":"464LOZGVIB2X","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"464LOZGVIB2XDNJX","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"464LOZGV","created_at":"2026-05-18T12:32:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:464LOZGVIB2XDNJX6BVRKHEFWF","target":"record","payload":{"canonical_record":{"source":{"id":"1803.08541","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"q-bio.NC","submitted_at":"2018-03-22T18:46:21Z","cross_cats_sorted":[],"title_canon_sha256":"25d58f92552100309cf291c1a266d540ddfde8ec4b93323d0319795023b04123","abstract_canon_sha256":"5292dd761ba59e45d10dc3741c8240658e3f857deb08de22819c692055c0fc28"},"schema_version":"1.0"},"canonical_sha256":"e7b8b764d5407571b537f06b151c85b17426a122267c8cf5bff0e11478cde44f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:07.067002Z","signature_b64":"iDZUQtaNpAlqPctKQUMGWxnCwTdCMsTJLvVwq9Zv6CEXzQ+2o5+NEG/Vclxe3zCxXiRa+Jyvon0m7XnElPRiBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e7b8b764d5407571b537f06b151c85b17426a122267c8cf5bff0e11478cde44f","last_reissued_at":"2026-05-17T23:43:07.066552Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:07.066552Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.08541","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-17T23:43:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"icKc24pR1ptyBTCMJNAQitxleoJr7rt0FcDKW8Lwh9EK8s5evOZYWDSIsJxvV5bAtntDnR0ss83m/Vvb04eUCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T16:37:56.782450Z"},"content_sha256":"956d4a36e825466712feb784103a0580713e122bf4c21849b60d8d34c96a2844","schema_version":"1.0","event_id":"sha256:956d4a36e825466712feb784103a0580713e122bf4c21849b60d8d34c96a2844"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:464LOZGVIB2XDNJX6BVRKHEFWF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A spectrum of routing strategies for brain networks","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"q-bio.NC","authors_text":"Andrea Avena-Koenigsberger, Artemy Kolchinsky, Martijn van den Heuvel, Olaf Sporns, Patric Hagmann, Xiaoran Yan","submitted_at":"2018-03-22T18:46:21Z","abstract_excerpt":"Communication of signals among nodes in a complex network poses fundamental problems of efficiency and cost. Routing of messages along shortest paths requires global information about the topology, while spreading by diffusion, which operates according to local topological features, is informationally \"cheap\" but inefficient. We introduce a stochastic model for network communication that combines varying amounts of local and global information about the network topology. The model generates a continuous spectrum of dynamics that converge onto shortest-path and random-walk (diffusion) communica"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.08541","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-17T23:43:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2kcRWR5seJUuzM+z8v09DXTJ3vHBKRynVdwUUDlscpkEaU8yGAyHdVNg9bNtqfCQCse5Bd7q2bBlL2cq5pABAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T16:37:56.782914Z"},"content_sha256":"64246a7d679c35763befab74228b4fcec417fb6f21cf1c29940688d99a973a8e","schema_version":"1.0","event_id":"sha256:64246a7d679c35763befab74228b4fcec417fb6f21cf1c29940688d99a973a8e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/464LOZGVIB2XDNJX6BVRKHEFWF/bundle.json","state_url":"https://pith.science/pith/464LOZGVIB2XDNJX6BVRKHEFWF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/464LOZGVIB2XDNJX6BVRKHEFWF/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-26T16:37:56Z","links":{"resolver":"https://pith.science/pith/464LOZGVIB2XDNJX6BVRKHEFWF","bundle":"https://pith.science/pith/464LOZGVIB2XDNJX6BVRKHEFWF/bundle.json","state":"https://pith.science/pith/464LOZGVIB2XDNJX6BVRKHEFWF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/464LOZGVIB2XDNJX6BVRKHEFWF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:464LOZGVIB2XDNJX6BVRKHEFWF","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":"5292dd761ba59e45d10dc3741c8240658e3f857deb08de22819c692055c0fc28","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"q-bio.NC","submitted_at":"2018-03-22T18:46:21Z","title_canon_sha256":"25d58f92552100309cf291c1a266d540ddfde8ec4b93323d0319795023b04123"},"schema_version":"1.0","source":{"id":"1803.08541","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.08541","created_at":"2026-05-17T23:43:07Z"},{"alias_kind":"arxiv_version","alias_value":"1803.08541v1","created_at":"2026-05-17T23:43:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.08541","created_at":"2026-05-17T23:43:07Z"},{"alias_kind":"pith_short_12","alias_value":"464LOZGVIB2X","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"464LOZGVIB2XDNJX","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"464LOZGV","created_at":"2026-05-18T12:32:05Z"}],"graph_snapshots":[{"event_id":"sha256:64246a7d679c35763befab74228b4fcec417fb6f21cf1c29940688d99a973a8e","target":"graph","created_at":"2026-05-17T23:43:07Z","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":"Communication of signals among nodes in a complex network poses fundamental problems of efficiency and cost. Routing of messages along shortest paths requires global information about the topology, while spreading by diffusion, which operates according to local topological features, is informationally \"cheap\" but inefficient. We introduce a stochastic model for network communication that combines varying amounts of local and global information about the network topology. The model generates a continuous spectrum of dynamics that converge onto shortest-path and random-walk (diffusion) communica","authors_text":"Andrea Avena-Koenigsberger, Artemy Kolchinsky, Martijn van den Heuvel, Olaf Sporns, Patric Hagmann, Xiaoran Yan","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"q-bio.NC","submitted_at":"2018-03-22T18:46:21Z","title":"A spectrum of routing strategies for brain networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.08541","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:956d4a36e825466712feb784103a0580713e122bf4c21849b60d8d34c96a2844","target":"record","created_at":"2026-05-17T23:43:07Z","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":"5292dd761ba59e45d10dc3741c8240658e3f857deb08de22819c692055c0fc28","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"q-bio.NC","submitted_at":"2018-03-22T18:46:21Z","title_canon_sha256":"25d58f92552100309cf291c1a266d540ddfde8ec4b93323d0319795023b04123"},"schema_version":"1.0","source":{"id":"1803.08541","kind":"arxiv","version":1}},"canonical_sha256":"e7b8b764d5407571b537f06b151c85b17426a122267c8cf5bff0e11478cde44f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e7b8b764d5407571b537f06b151c85b17426a122267c8cf5bff0e11478cde44f","first_computed_at":"2026-05-17T23:43:07.066552Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:43:07.066552Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iDZUQtaNpAlqPctKQUMGWxnCwTdCMsTJLvVwq9Zv6CEXzQ+2o5+NEG/Vclxe3zCxXiRa+Jyvon0m7XnElPRiBQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:43:07.067002Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.08541","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:956d4a36e825466712feb784103a0580713e122bf4c21849b60d8d34c96a2844","sha256:64246a7d679c35763befab74228b4fcec417fb6f21cf1c29940688d99a973a8e"],"state_sha256":"dc9a53f2bfc73c891ac18406c0d1f627f284330bb8188b40932a9c01bb63367b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hJJkHfX7pg0LZ9ixpqY47UVusUNE0jWp3p8qZ2925PCFpp5f4RpVhbgbnr0DwjphObpYG8F18a5GkjLNmrwvAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T16:37:56.786195Z","bundle_sha256":"4c0c05b4828e0cfa76e440ffd6ec3c7f2410e00f1effb600d9a73f5316304268"}}