{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:2OSIZ2IP5ERKL2PET5CDHE6ANW","short_pith_number":"pith:2OSIZ2IP","schema_version":"1.0","canonical_sha256":"d3a48ce90fe922a5e9e49f443393c06d9b9c0cec0d5ca0f29dac201dd3332c85","source":{"kind":"arxiv","id":"1711.09541","version":1},"attestation_state":"computed","paper":{"title":"TIMERS: Error-Bounded SVD Restart on Dynamic Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"Jian Pei, Peng Cui, Wenwu Zhu, Xiao Wang, Ziwei Zhang","submitted_at":"2017-11-27T05:37:09Z","abstract_excerpt":"Singular Value Decomposition (SVD) is a popular approach in various network applications, such as link prediction and network parameter characterization. Incremental SVD approaches are proposed to process newly changed nodes and edges in dynamic networks. However, incremental SVD approaches suffer from serious error accumulation inevitably due to approximation on incremental updates. SVD restart is an effective approach to reset the aggregated error, but when to restart SVD for dynamic networks is not addressed in literature. In this paper, we propose TIMERS, Theoretically Instructed Maximum-E"},"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.09541","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-11-27T05:37:09Z","cross_cats_sorted":[],"title_canon_sha256":"eb53bc92e535c1d4216b6710b3e295668cfb4ceba387334b8ba8a6da4ca794c0","abstract_canon_sha256":"42e5494a21e74434618fe697890b062c289386574c5b2659a5ea1011041ced52"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:35.218833Z","signature_b64":"kWTnKMroatPrdr29WYkuMi0pn/Bv0vXJAH5aNmrtxnNDG0uvJzYw5DnaCVkrBO9lcLIE2mIMJS6PFHQDBdThCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d3a48ce90fe922a5e9e49f443393c06d9b9c0cec0d5ca0f29dac201dd3332c85","last_reissued_at":"2026-05-18T00:29:35.218228Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:35.218228Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"TIMERS: Error-Bounded SVD Restart on Dynamic Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"Jian Pei, Peng Cui, Wenwu Zhu, Xiao Wang, Ziwei Zhang","submitted_at":"2017-11-27T05:37:09Z","abstract_excerpt":"Singular Value Decomposition (SVD) is a popular approach in various network applications, such as link prediction and network parameter characterization. Incremental SVD approaches are proposed to process newly changed nodes and edges in dynamic networks. However, incremental SVD approaches suffer from serious error accumulation inevitably due to approximation on incremental updates. SVD restart is an effective approach to reset the aggregated error, but when to restart SVD for dynamic networks is not addressed in literature. In this paper, we propose TIMERS, Theoretically Instructed Maximum-E"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.09541","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.09541","created_at":"2026-05-18T00:29:35.218331+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.09541v1","created_at":"2026-05-18T00:29:35.218331+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.09541","created_at":"2026-05-18T00:29:35.218331+00:00"},{"alias_kind":"pith_short_12","alias_value":"2OSIZ2IP5ERK","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_16","alias_value":"2OSIZ2IP5ERKL2PE","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_8","alias_value":"2OSIZ2IP","created_at":"2026-05-18T12:30:55.937587+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/2OSIZ2IP5ERKL2PET5CDHE6ANW","json":"https://pith.science/pith/2OSIZ2IP5ERKL2PET5CDHE6ANW.json","graph_json":"https://pith.science/api/pith-number/2OSIZ2IP5ERKL2PET5CDHE6ANW/graph.json","events_json":"https://pith.science/api/pith-number/2OSIZ2IP5ERKL2PET5CDHE6ANW/events.json","paper":"https://pith.science/paper/2OSIZ2IP"},"agent_actions":{"view_html":"https://pith.science/pith/2OSIZ2IP5ERKL2PET5CDHE6ANW","download_json":"https://pith.science/pith/2OSIZ2IP5ERKL2PET5CDHE6ANW.json","view_paper":"https://pith.science/paper/2OSIZ2IP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.09541&json=true","fetch_graph":"https://pith.science/api/pith-number/2OSIZ2IP5ERKL2PET5CDHE6ANW/graph.json","fetch_events":"https://pith.science/api/pith-number/2OSIZ2IP5ERKL2PET5CDHE6ANW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2OSIZ2IP5ERKL2PET5CDHE6ANW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2OSIZ2IP5ERKL2PET5CDHE6ANW/action/storage_attestation","attest_author":"https://pith.science/pith/2OSIZ2IP5ERKL2PET5CDHE6ANW/action/author_attestation","sign_citation":"https://pith.science/pith/2OSIZ2IP5ERKL2PET5CDHE6ANW/action/citation_signature","submit_replication":"https://pith.science/pith/2OSIZ2IP5ERKL2PET5CDHE6ANW/action/replication_record"}},"created_at":"2026-05-18T00:29:35.218331+00:00","updated_at":"2026-05-18T00:29:35.218331+00:00"}