{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:CWMYOLZH6FMXYTP2GFRWIM7VZ5","short_pith_number":"pith:CWMYOLZH","schema_version":"1.0","canonical_sha256":"1599872f27f1597c4dfa31636433f5cf699499f6924d24422a62e528bafdb3f1","source":{"kind":"arxiv","id":"1711.00121","version":1},"attestation_state":"computed","paper":{"title":"Dynamical SimRank Search on Time-Varying Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Julie A. McCann, Weiren Yu, Wenjie Zhang, Xuemin Lin","submitted_at":"2017-10-31T21:50:10Z","abstract_excerpt":"In this article, we study the efficient dynamical computation of all-pairs SimRanks on time-varying graphs. Li {\\em et al}.'s approach requires $O(r^4 n^2)$ time and $O(r^2 n^2)$ memory in a graph with $n$ nodes, where $r$ is the target rank of the low-rank SVD. (1) We first consider edge update that does not accompany new node insertions. We show that the SimRank update $\\Delta S$ in response to every link update is expressible as a rank-one Sylvester matrix equation. This provides an incremental method requiring $O(Kn^2)$ time and $O(n^2)$ memory in the worst case to update all pairs of simi"},"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":"1711.00121","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2017-10-31T21:50:10Z","cross_cats_sorted":[],"title_canon_sha256":"16aa48ef2ed8ac81e34e8e0f633314fcdc302064b87aeed2a532204106dc9c33","abstract_canon_sha256":"29f64fc16bf678855eaaf046fdbea7708f48b3fd618588b5c5adeb36be1d115d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:35.145835Z","signature_b64":"F3Y9T+l5fYeA6qIQJzK81giZQsx9O9rYdXxB+9F6TMg2AUhtePeODf8wyCb7nr2Z4h2BE3+gG5uHC0u5BvowBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1599872f27f1597c4dfa31636433f5cf699499f6924d24422a62e528bafdb3f1","last_reissued_at":"2026-05-18T00:31:35.145295Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:35.145295Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dynamical SimRank Search on Time-Varying Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Julie A. McCann, Weiren Yu, Wenjie Zhang, Xuemin Lin","submitted_at":"2017-10-31T21:50:10Z","abstract_excerpt":"In this article, we study the efficient dynamical computation of all-pairs SimRanks on time-varying graphs. Li {\\em et al}.'s approach requires $O(r^4 n^2)$ time and $O(r^2 n^2)$ memory in a graph with $n$ nodes, where $r$ is the target rank of the low-rank SVD. (1) We first consider edge update that does not accompany new node insertions. We show that the SimRank update $\\Delta S$ in response to every link update is expressible as a rank-one Sylvester matrix equation. This provides an incremental method requiring $O(Kn^2)$ time and $O(n^2)$ memory in the worst case to update all pairs of simi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.00121","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":"1711.00121","created_at":"2026-05-18T00:31:35.145385+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.00121v1","created_at":"2026-05-18T00:31:35.145385+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.00121","created_at":"2026-05-18T00:31:35.145385+00:00"},{"alias_kind":"pith_short_12","alias_value":"CWMYOLZH6FMX","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_16","alias_value":"CWMYOLZH6FMXYTP2","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_8","alias_value":"CWMYOLZH","created_at":"2026-05-18T12:31:10.602751+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/CWMYOLZH6FMXYTP2GFRWIM7VZ5","json":"https://pith.science/pith/CWMYOLZH6FMXYTP2GFRWIM7VZ5.json","graph_json":"https://pith.science/api/pith-number/CWMYOLZH6FMXYTP2GFRWIM7VZ5/graph.json","events_json":"https://pith.science/api/pith-number/CWMYOLZH6FMXYTP2GFRWIM7VZ5/events.json","paper":"https://pith.science/paper/CWMYOLZH"},"agent_actions":{"view_html":"https://pith.science/pith/CWMYOLZH6FMXYTP2GFRWIM7VZ5","download_json":"https://pith.science/pith/CWMYOLZH6FMXYTP2GFRWIM7VZ5.json","view_paper":"https://pith.science/paper/CWMYOLZH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.00121&json=true","fetch_graph":"https://pith.science/api/pith-number/CWMYOLZH6FMXYTP2GFRWIM7VZ5/graph.json","fetch_events":"https://pith.science/api/pith-number/CWMYOLZH6FMXYTP2GFRWIM7VZ5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CWMYOLZH6FMXYTP2GFRWIM7VZ5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CWMYOLZH6FMXYTP2GFRWIM7VZ5/action/storage_attestation","attest_author":"https://pith.science/pith/CWMYOLZH6FMXYTP2GFRWIM7VZ5/action/author_attestation","sign_citation":"https://pith.science/pith/CWMYOLZH6FMXYTP2GFRWIM7VZ5/action/citation_signature","submit_replication":"https://pith.science/pith/CWMYOLZH6FMXYTP2GFRWIM7VZ5/action/replication_record"}},"created_at":"2026-05-18T00:31:35.145385+00:00","updated_at":"2026-05-18T00:31:35.145385+00:00"}