{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:NQ3UGUYWG4SMTNHOPGHEQKHHT6","short_pith_number":"pith:NQ3UGUYW","schema_version":"1.0","canonical_sha256":"6c374353163724c9b4ee798e4828e79fb550b5092b2dae297184749fcb117b0f","source":{"kind":"arxiv","id":"1311.0460","version":1},"attestation_state":"computed","paper":{"title":"An Adaptive Amoeba Algorithm for Shortest Path Tree Computation in Dynamic Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Felix T.S. Chan, Qi Liu, Sankaran Mahadevan, Xiaoge Zhang, Yong Deng, Yong Hu, Zili Zhang","submitted_at":"2013-11-03T12:30:37Z","abstract_excerpt":"This paper presents an adaptive amoeba algorithm to address the shortest path tree (SPT) problem in dynamic graphs. In dynamic graphs, the edge weight updates consists of three categories: edge weight increases, edge weight decreases, the mixture of them. Existing work on this problem solve this issue through analyzing the nodes influenced by the edge weight updates and recompute these affected vertices. However, when the network becomes big, the process will become complex. The proposed method can overcome the disadvantages of the existing approaches. The most important feature of this algori"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1311.0460","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2013-11-03T12:30:37Z","cross_cats_sorted":[],"title_canon_sha256":"15e604242c1c90baebdcac745e642a247cb788886243b8071e843adc019cbf58","abstract_canon_sha256":"1dd76590e174011994b622b798784bfbe38a38c73d10327b392b268781a87c00"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:08:05.891626Z","signature_b64":"hb6mWIxOoik17qDiZIzPYnhLdbJ8f5oAJjGF+tH4bNSc1JFw6MLSPQTC+ZREjVgSLZ2bYYgBVPlnLnJxXlAABA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6c374353163724c9b4ee798e4828e79fb550b5092b2dae297184749fcb117b0f","last_reissued_at":"2026-05-18T03:08:05.890929Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:08:05.890929Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Adaptive Amoeba Algorithm for Shortest Path Tree Computation in Dynamic Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Felix T.S. Chan, Qi Liu, Sankaran Mahadevan, Xiaoge Zhang, Yong Deng, Yong Hu, Zili Zhang","submitted_at":"2013-11-03T12:30:37Z","abstract_excerpt":"This paper presents an adaptive amoeba algorithm to address the shortest path tree (SPT) problem in dynamic graphs. In dynamic graphs, the edge weight updates consists of three categories: edge weight increases, edge weight decreases, the mixture of them. Existing work on this problem solve this issue through analyzing the nodes influenced by the edge weight updates and recompute these affected vertices. However, when the network becomes big, the process will become complex. The proposed method can overcome the disadvantages of the existing approaches. The most important feature of this algori"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.0460","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1311.0460","created_at":"2026-05-18T03:08:05.891033+00:00"},{"alias_kind":"arxiv_version","alias_value":"1311.0460v1","created_at":"2026-05-18T03:08:05.891033+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.0460","created_at":"2026-05-18T03:08:05.891033+00:00"},{"alias_kind":"pith_short_12","alias_value":"NQ3UGUYWG4SM","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_16","alias_value":"NQ3UGUYWG4SMTNHO","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_8","alias_value":"NQ3UGUYW","created_at":"2026-05-18T12:27:52.871228+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NQ3UGUYWG4SMTNHOPGHEQKHHT6","json":"https://pith.science/pith/NQ3UGUYWG4SMTNHOPGHEQKHHT6.json","graph_json":"https://pith.science/api/pith-number/NQ3UGUYWG4SMTNHOPGHEQKHHT6/graph.json","events_json":"https://pith.science/api/pith-number/NQ3UGUYWG4SMTNHOPGHEQKHHT6/events.json","paper":"https://pith.science/paper/NQ3UGUYW"},"agent_actions":{"view_html":"https://pith.science/pith/NQ3UGUYWG4SMTNHOPGHEQKHHT6","download_json":"https://pith.science/pith/NQ3UGUYWG4SMTNHOPGHEQKHHT6.json","view_paper":"https://pith.science/paper/NQ3UGUYW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1311.0460&json=true","fetch_graph":"https://pith.science/api/pith-number/NQ3UGUYWG4SMTNHOPGHEQKHHT6/graph.json","fetch_events":"https://pith.science/api/pith-number/NQ3UGUYWG4SMTNHOPGHEQKHHT6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NQ3UGUYWG4SMTNHOPGHEQKHHT6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NQ3UGUYWG4SMTNHOPGHEQKHHT6/action/storage_attestation","attest_author":"https://pith.science/pith/NQ3UGUYWG4SMTNHOPGHEQKHHT6/action/author_attestation","sign_citation":"https://pith.science/pith/NQ3UGUYWG4SMTNHOPGHEQKHHT6/action/citation_signature","submit_replication":"https://pith.science/pith/NQ3UGUYWG4SMTNHOPGHEQKHHT6/action/replication_record"}},"created_at":"2026-05-18T03:08:05.891033+00:00","updated_at":"2026-05-18T03:08:05.891033+00:00"}