{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:GKTFQ5WNTEG7D5WOSNIQJ5E2CP","short_pith_number":"pith:GKTFQ5WN","canonical_record":{"source":{"id":"1601.08189","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-01-29T16:48:55Z","cross_cats_sorted":["cs.DS","math.NA"],"title_canon_sha256":"88450f8f538175bdb9857ffdaec23b14bb27c13e9ef95daab0ffc0e268c3bc8f","abstract_canon_sha256":"7ffbb053a35ad239ae2c0589da69379d36fe07f6b3c7520a5d92ae4fd1207705"},"schema_version":"1.0"},"canonical_sha256":"32a65876cd990df1f6ce935104f49a13d6f31b6f874218fe9866a6186feb605b","source":{"kind":"arxiv","id":"1601.08189","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.08189","created_at":"2026-05-18T01:19:38Z"},{"alias_kind":"arxiv_version","alias_value":"1601.08189v2","created_at":"2026-05-18T01:19:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.08189","created_at":"2026-05-18T01:19:38Z"},{"alias_kind":"pith_short_12","alias_value":"GKTFQ5WNTEG7","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"GKTFQ5WNTEG7D5WO","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"GKTFQ5WN","created_at":"2026-05-18T12:30:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:GKTFQ5WNTEG7D5WOSNIQJ5E2CP","target":"record","payload":{"canonical_record":{"source":{"id":"1601.08189","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-01-29T16:48:55Z","cross_cats_sorted":["cs.DS","math.NA"],"title_canon_sha256":"88450f8f538175bdb9857ffdaec23b14bb27c13e9ef95daab0ffc0e268c3bc8f","abstract_canon_sha256":"7ffbb053a35ad239ae2c0589da69379d36fe07f6b3c7520a5d92ae4fd1207705"},"schema_version":"1.0"},"canonical_sha256":"32a65876cd990df1f6ce935104f49a13d6f31b6f874218fe9866a6186feb605b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:38.197106Z","signature_b64":"GOLeMku+/JD37caFHS17CxY4SZjaTPazLQC+Y+y8eYLU98gNPidkWH5MbFrlX5hCHrdVAwwQvEKZ/WRxEpwtAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"32a65876cd990df1f6ce935104f49a13d6f31b6f874218fe9866a6186feb605b","last_reissued_at":"2026-05-18T01:19:38.196458Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:38.196458Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1601.08189","source_version":2,"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:19:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DIpLNYXBaqgWaeq1syd0ZAvWU6wU9hxNUKLgxDBu13ZIIrK/Tixuuw1WZ6MMN5oR/8bc6HB179ndGfM6dFw8CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T15:08:39.206751Z"},"content_sha256":"2918df7dfa6e4c20f6b73b0e1f111aaf1eb7dd59a4135d1c1b464522e112d970","schema_version":"1.0","event_id":"sha256:2918df7dfa6e4c20f6b73b0e1f111aaf1eb7dd59a4135d1c1b464522e112d970"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:GKTFQ5WNTEG7D5WOSNIQJ5E2CP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Right Way to Search Evolving Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.NA"],"primary_cat":"cs.SI","authors_text":"Jiahao Chen, Weijian Zhang","submitted_at":"2016-01-29T16:48:55Z","abstract_excerpt":"Evolving graphs arise in problems where interrelations between data change over time. We present a breadth first search (BFS) algorithm for evolving graphs that computes the most direct influences between nodes at two different times. Using simple examples, we show that naive unfoldings of adjacency matrices miscount the number of temporal paths. By mapping an evolving graph to an adjacency matrix of an equivalent static graph, we prove that our generalization of the BFS algorithm correctly accounts for paths that traverse both space and time. Finally, we demonstrate how the BFS over evolving "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.08189","kind":"arxiv","version":2},"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:19:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T0vPLkTE7K3e/a3tkhGSyMxv6PibFGcbsWox67ssYTwOIY1Xp8DfUilbSaBjrNKGCK/+uupfrIAlXRSvZG13AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T15:08:39.207418Z"},"content_sha256":"b55a5e57f3f87e078d64a347abc8ca7a6b2541ad9e191b36a1c5b7ccc4f8aecc","schema_version":"1.0","event_id":"sha256:b55a5e57f3f87e078d64a347abc8ca7a6b2541ad9e191b36a1c5b7ccc4f8aecc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GKTFQ5WNTEG7D5WOSNIQJ5E2CP/bundle.json","state_url":"https://pith.science/pith/GKTFQ5WNTEG7D5WOSNIQJ5E2CP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GKTFQ5WNTEG7D5WOSNIQJ5E2CP/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-24T15:08:39Z","links":{"resolver":"https://pith.science/pith/GKTFQ5WNTEG7D5WOSNIQJ5E2CP","bundle":"https://pith.science/pith/GKTFQ5WNTEG7D5WOSNIQJ5E2CP/bundle.json","state":"https://pith.science/pith/GKTFQ5WNTEG7D5WOSNIQJ5E2CP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GKTFQ5WNTEG7D5WOSNIQJ5E2CP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:GKTFQ5WNTEG7D5WOSNIQJ5E2CP","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":"7ffbb053a35ad239ae2c0589da69379d36fe07f6b3c7520a5d92ae4fd1207705","cross_cats_sorted":["cs.DS","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-01-29T16:48:55Z","title_canon_sha256":"88450f8f538175bdb9857ffdaec23b14bb27c13e9ef95daab0ffc0e268c3bc8f"},"schema_version":"1.0","source":{"id":"1601.08189","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.08189","created_at":"2026-05-18T01:19:38Z"},{"alias_kind":"arxiv_version","alias_value":"1601.08189v2","created_at":"2026-05-18T01:19:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.08189","created_at":"2026-05-18T01:19:38Z"},{"alias_kind":"pith_short_12","alias_value":"GKTFQ5WNTEG7","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"GKTFQ5WNTEG7D5WO","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"GKTFQ5WN","created_at":"2026-05-18T12:30:19Z"}],"graph_snapshots":[{"event_id":"sha256:b55a5e57f3f87e078d64a347abc8ca7a6b2541ad9e191b36a1c5b7ccc4f8aecc","target":"graph","created_at":"2026-05-18T01:19:38Z","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":"Evolving graphs arise in problems where interrelations between data change over time. We present a breadth first search (BFS) algorithm for evolving graphs that computes the most direct influences between nodes at two different times. Using simple examples, we show that naive unfoldings of adjacency matrices miscount the number of temporal paths. By mapping an evolving graph to an adjacency matrix of an equivalent static graph, we prove that our generalization of the BFS algorithm correctly accounts for paths that traverse both space and time. Finally, we demonstrate how the BFS over evolving ","authors_text":"Jiahao Chen, Weijian Zhang","cross_cats":["cs.DS","math.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-01-29T16:48:55Z","title":"The Right Way to Search Evolving Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.08189","kind":"arxiv","version":2},"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:2918df7dfa6e4c20f6b73b0e1f111aaf1eb7dd59a4135d1c1b464522e112d970","target":"record","created_at":"2026-05-18T01:19:38Z","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":"7ffbb053a35ad239ae2c0589da69379d36fe07f6b3c7520a5d92ae4fd1207705","cross_cats_sorted":["cs.DS","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-01-29T16:48:55Z","title_canon_sha256":"88450f8f538175bdb9857ffdaec23b14bb27c13e9ef95daab0ffc0e268c3bc8f"},"schema_version":"1.0","source":{"id":"1601.08189","kind":"arxiv","version":2}},"canonical_sha256":"32a65876cd990df1f6ce935104f49a13d6f31b6f874218fe9866a6186feb605b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"32a65876cd990df1f6ce935104f49a13d6f31b6f874218fe9866a6186feb605b","first_computed_at":"2026-05-18T01:19:38.196458Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:19:38.196458Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GOLeMku+/JD37caFHS17CxY4SZjaTPazLQC+Y+y8eYLU98gNPidkWH5MbFrlX5hCHrdVAwwQvEKZ/WRxEpwtAA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:19:38.197106Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.08189","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2918df7dfa6e4c20f6b73b0e1f111aaf1eb7dd59a4135d1c1b464522e112d970","sha256:b55a5e57f3f87e078d64a347abc8ca7a6b2541ad9e191b36a1c5b7ccc4f8aecc"],"state_sha256":"a072ba1109224aab596a53ba09fc2aa326bcd1a37281f4401213679e44b0c045"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eRJlR06n1ii4uYSGhGR9npc2h1OG9PfUjtjzJ6yOyjy5gUaanvFW04pVAiDaeGYeoo4Ce/B+P3ivwp0jWO1oCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T15:08:39.210909Z","bundle_sha256":"3e13dcae14a5eb8934de534fd82321fcb388e38316d5d1757d5799f012317aad"}}