{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:IFQWPJMOXRXFTC5CTCMYZU4P7H","short_pith_number":"pith:IFQWPJMO","schema_version":"1.0","canonical_sha256":"416167a58ebc6e598ba298998cd38ff9d858671b5c6426e1dc5408b8f0408a02","source":{"kind":"arxiv","id":"1306.3002","version":1},"attestation_state":"computed","paper":{"title":"A Convergence Theorem for the Graph Shift-type Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Longbing Cao, Xuhui Fan","submitted_at":"2013-06-13T01:00:21Z","abstract_excerpt":"Graph Shift (GS) algorithms are recently focused as a promising approach for discovering dense subgraphs in noisy data. However, there are no theoretical foundations for proving the convergence of the GS Algorithm. In this paper, we propose a generic theoretical framework consisting of three key GS components: simplex of generated sequence set, monotonic and continuous objective function and closed mapping. We prove that GS algorithms with such components can be transformed to fit the Zangwill's convergence theorem, and the sequence set generated by the GS procedures always terminates at a loc"},"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":"1306.3002","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-06-13T01:00:21Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"da1eab0fd67916fac1697ba2c67f2327e8079c4e6fcaadf1dfdf35257d62d74f","abstract_canon_sha256":"70d254d65f9c034d3fa291a02e24c94232292217370f1369baf46a47b4e465b4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:20:59.839081Z","signature_b64":"kE6ngs+ntNAjD9IhgKzDuH/86CWeHamO1Z4E499+7ryEpYudX9UF29gwXSPPEj3rnVnUgb3fwkc+CWi2DvTuCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"416167a58ebc6e598ba298998cd38ff9d858671b5c6426e1dc5408b8f0408a02","last_reissued_at":"2026-05-18T03:20:59.838487Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:20:59.838487Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Convergence Theorem for the Graph Shift-type Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Longbing Cao, Xuhui Fan","submitted_at":"2013-06-13T01:00:21Z","abstract_excerpt":"Graph Shift (GS) algorithms are recently focused as a promising approach for discovering dense subgraphs in noisy data. However, there are no theoretical foundations for proving the convergence of the GS Algorithm. In this paper, we propose a generic theoretical framework consisting of three key GS components: simplex of generated sequence set, monotonic and continuous objective function and closed mapping. We prove that GS algorithms with such components can be transformed to fit the Zangwill's convergence theorem, and the sequence set generated by the GS procedures always terminates at a loc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.3002","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":"1306.3002","created_at":"2026-05-18T03:20:59.838582+00:00"},{"alias_kind":"arxiv_version","alias_value":"1306.3002v1","created_at":"2026-05-18T03:20:59.838582+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.3002","created_at":"2026-05-18T03:20:59.838582+00:00"},{"alias_kind":"pith_short_12","alias_value":"IFQWPJMOXRXF","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_16","alias_value":"IFQWPJMOXRXFTC5C","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_8","alias_value":"IFQWPJMO","created_at":"2026-05-18T12:27:46.883200+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/IFQWPJMOXRXFTC5CTCMYZU4P7H","json":"https://pith.science/pith/IFQWPJMOXRXFTC5CTCMYZU4P7H.json","graph_json":"https://pith.science/api/pith-number/IFQWPJMOXRXFTC5CTCMYZU4P7H/graph.json","events_json":"https://pith.science/api/pith-number/IFQWPJMOXRXFTC5CTCMYZU4P7H/events.json","paper":"https://pith.science/paper/IFQWPJMO"},"agent_actions":{"view_html":"https://pith.science/pith/IFQWPJMOXRXFTC5CTCMYZU4P7H","download_json":"https://pith.science/pith/IFQWPJMOXRXFTC5CTCMYZU4P7H.json","view_paper":"https://pith.science/paper/IFQWPJMO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1306.3002&json=true","fetch_graph":"https://pith.science/api/pith-number/IFQWPJMOXRXFTC5CTCMYZU4P7H/graph.json","fetch_events":"https://pith.science/api/pith-number/IFQWPJMOXRXFTC5CTCMYZU4P7H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IFQWPJMOXRXFTC5CTCMYZU4P7H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IFQWPJMOXRXFTC5CTCMYZU4P7H/action/storage_attestation","attest_author":"https://pith.science/pith/IFQWPJMOXRXFTC5CTCMYZU4P7H/action/author_attestation","sign_citation":"https://pith.science/pith/IFQWPJMOXRXFTC5CTCMYZU4P7H/action/citation_signature","submit_replication":"https://pith.science/pith/IFQWPJMOXRXFTC5CTCMYZU4P7H/action/replication_record"}},"created_at":"2026-05-18T03:20:59.838582+00:00","updated_at":"2026-05-18T03:20:59.838582+00:00"}