{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:2OSY366K3CDS6DK6RNCXA72D2V","short_pith_number":"pith:2OSY366K","canonical_record":{"source":{"id":"1104.1355","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"q-bio.MN","submitted_at":"2011-04-07T15:23:24Z","cross_cats_sorted":["cs.DS","q-bio.NC","stat.CO"],"title_canon_sha256":"7cafff8f513375149ca5c61b9165d46db9ab1e071d023dca21ec8ed09b2e8d42","abstract_canon_sha256":"685201eec55f8ae62bbedb4832857a051fe28616be3f41eabb5df49fb943c7fd"},"schema_version":"1.0"},"canonical_sha256":"d3a58dfbcad8872f0d5e8b45707f43d55caccb44b97a8000354f41a5375ca46e","source":{"kind":"arxiv","id":"1104.1355","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.1355","created_at":"2026-05-18T04:20:23Z"},{"alias_kind":"arxiv_version","alias_value":"1104.1355v1","created_at":"2026-05-18T04:20:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.1355","created_at":"2026-05-18T04:20:23Z"},{"alias_kind":"pith_short_12","alias_value":"2OSY366K3CDS","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"2OSY366K3CDS6DK6","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"2OSY366K","created_at":"2026-05-18T12:26:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:2OSY366K3CDS6DK6RNCXA72D2V","target":"record","payload":{"canonical_record":{"source":{"id":"1104.1355","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"q-bio.MN","submitted_at":"2011-04-07T15:23:24Z","cross_cats_sorted":["cs.DS","q-bio.NC","stat.CO"],"title_canon_sha256":"7cafff8f513375149ca5c61b9165d46db9ab1e071d023dca21ec8ed09b2e8d42","abstract_canon_sha256":"685201eec55f8ae62bbedb4832857a051fe28616be3f41eabb5df49fb943c7fd"},"schema_version":"1.0"},"canonical_sha256":"d3a58dfbcad8872f0d5e8b45707f43d55caccb44b97a8000354f41a5375ca46e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:20:23.083967Z","signature_b64":"t6r7snC3cQVEfoTwgyAECcmhrM3x12ASvOKbkt1Lc2Iw++kl/QuyKy9QAWkvkCJd8bPDNOkfrQjME5Yqa4tXBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d3a58dfbcad8872f0d5e8b45707f43d55caccb44b97a8000354f41a5375ca46e","last_reissued_at":"2026-05-18T04:20:23.083322Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:20:23.083322Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1104.1355","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-18T04:20:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ctof+tAh+n1Po1DnMTf1eNsQSy+1N5usxEcG+d4vf4lDO1kOIMk343TKfho2w1lYJihfsul8jjOQSQpeFHGFCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T08:07:22.311026Z"},"content_sha256":"a8241b80a08c66dc638ca1bac54f34887494b9edc14a0533d720e419ff20eed4","schema_version":"1.0","event_id":"sha256:a8241b80a08c66dc638ca1bac54f34887494b9edc14a0533d720e419ff20eed4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:2OSY366K3CDS6DK6RNCXA72D2V","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Recursive Shortest Path Algorithm with Application to Density-integration of Weighted Graphs","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":["cs.DS","q-bio.NC","stat.CO"],"primary_cat":"q-bio.MN","authors_text":"Andrew Simmons, Cedric E. Ginestet","submitted_at":"2011-04-07T15:23:24Z","abstract_excerpt":"Graph theory is increasingly commonly utilised in genetics, proteomics and neuroimaging. In such fields, the data of interest generally constitute weighted graphs. Analysis of such weighted graphs often require the integration of topological metrics with respect to the density of the graph. Here, density refers to the proportion of the number of edges present in that graph. When topological metrics based on shortest paths are of interest, such density-integration usually necessitates the iterative application of Dijkstra's algorithm in order to compute the shortest path matrix at each density "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.1355","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-18T04:20:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9Of5AkdiefV0SM4u0Dt/cVoJntVQ9/Uq7FOg++Dxv5btiEu2MPjQ5+eBGVA6RvD/pv48bgNv7nPiXg778g4VDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T08:07:22.311392Z"},"content_sha256":"e718faf1b1ee6b395679937256ad7915de0851352ea27c3fc5b5beb95d9aa1c7","schema_version":"1.0","event_id":"sha256:e718faf1b1ee6b395679937256ad7915de0851352ea27c3fc5b5beb95d9aa1c7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2OSY366K3CDS6DK6RNCXA72D2V/bundle.json","state_url":"https://pith.science/pith/2OSY366K3CDS6DK6RNCXA72D2V/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2OSY366K3CDS6DK6RNCXA72D2V/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-25T08:07:22Z","links":{"resolver":"https://pith.science/pith/2OSY366K3CDS6DK6RNCXA72D2V","bundle":"https://pith.science/pith/2OSY366K3CDS6DK6RNCXA72D2V/bundle.json","state":"https://pith.science/pith/2OSY366K3CDS6DK6RNCXA72D2V/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2OSY366K3CDS6DK6RNCXA72D2V/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:2OSY366K3CDS6DK6RNCXA72D2V","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":"685201eec55f8ae62bbedb4832857a051fe28616be3f41eabb5df49fb943c7fd","cross_cats_sorted":["cs.DS","q-bio.NC","stat.CO"],"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"q-bio.MN","submitted_at":"2011-04-07T15:23:24Z","title_canon_sha256":"7cafff8f513375149ca5c61b9165d46db9ab1e071d023dca21ec8ed09b2e8d42"},"schema_version":"1.0","source":{"id":"1104.1355","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.1355","created_at":"2026-05-18T04:20:23Z"},{"alias_kind":"arxiv_version","alias_value":"1104.1355v1","created_at":"2026-05-18T04:20:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.1355","created_at":"2026-05-18T04:20:23Z"},{"alias_kind":"pith_short_12","alias_value":"2OSY366K3CDS","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"2OSY366K3CDS6DK6","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"2OSY366K","created_at":"2026-05-18T12:26:18Z"}],"graph_snapshots":[{"event_id":"sha256:e718faf1b1ee6b395679937256ad7915de0851352ea27c3fc5b5beb95d9aa1c7","target":"graph","created_at":"2026-05-18T04:20:23Z","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":"Graph theory is increasingly commonly utilised in genetics, proteomics and neuroimaging. In such fields, the data of interest generally constitute weighted graphs. Analysis of such weighted graphs often require the integration of topological metrics with respect to the density of the graph. Here, density refers to the proportion of the number of edges present in that graph. When topological metrics based on shortest paths are of interest, such density-integration usually necessitates the iterative application of Dijkstra's algorithm in order to compute the shortest path matrix at each density ","authors_text":"Andrew Simmons, Cedric E. Ginestet","cross_cats":["cs.DS","q-bio.NC","stat.CO"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"q-bio.MN","submitted_at":"2011-04-07T15:23:24Z","title":"Recursive Shortest Path Algorithm with Application to Density-integration of Weighted Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.1355","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:a8241b80a08c66dc638ca1bac54f34887494b9edc14a0533d720e419ff20eed4","target":"record","created_at":"2026-05-18T04:20:23Z","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":"685201eec55f8ae62bbedb4832857a051fe28616be3f41eabb5df49fb943c7fd","cross_cats_sorted":["cs.DS","q-bio.NC","stat.CO"],"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"q-bio.MN","submitted_at":"2011-04-07T15:23:24Z","title_canon_sha256":"7cafff8f513375149ca5c61b9165d46db9ab1e071d023dca21ec8ed09b2e8d42"},"schema_version":"1.0","source":{"id":"1104.1355","kind":"arxiv","version":1}},"canonical_sha256":"d3a58dfbcad8872f0d5e8b45707f43d55caccb44b97a8000354f41a5375ca46e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d3a58dfbcad8872f0d5e8b45707f43d55caccb44b97a8000354f41a5375ca46e","first_computed_at":"2026-05-18T04:20:23.083322Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:20:23.083322Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"t6r7snC3cQVEfoTwgyAECcmhrM3x12ASvOKbkt1Lc2Iw++kl/QuyKy9QAWkvkCJd8bPDNOkfrQjME5Yqa4tXBw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:20:23.083967Z","signed_message":"canonical_sha256_bytes"},"source_id":"1104.1355","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a8241b80a08c66dc638ca1bac54f34887494b9edc14a0533d720e419ff20eed4","sha256:e718faf1b1ee6b395679937256ad7915de0851352ea27c3fc5b5beb95d9aa1c7"],"state_sha256":"9c1d36f977d9fb02824aed06c3b9b0d65b71d1d0e9d3e6fe6ad1fd0017ccedd9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zKFvNkPYb9p3A5qMEzVAxe/HfN881IZ9gcA5H0RMO6BsZ6ocyKxqn3tC+oQxA3rKPNONhqWyzPuoH8AcHfQmAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T08:07:22.313354Z","bundle_sha256":"8bb3a4887a5ff26693f435aba6227e4c2694afa2392ea3cf8cfea2942ec92b76"}}