{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:AV7TM6DR4LU6RESRD2KHUQVPJV","short_pith_number":"pith:AV7TM6DR","schema_version":"1.0","canonical_sha256":"057f367871e2e9e892511e947a42af4d673e1af1437b35624f2778d2b503aa0c","source":{"kind":"arxiv","id":"1711.01228","version":2},"attestation_state":"computed","paper":{"title":"A Fast Successive Over-Relaxation Algorithm for Force-Directed Network Graph Drawing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Yong-Xian Wang, Zheng-Hua Wang","submitted_at":"2017-11-03T16:33:42Z","abstract_excerpt":"Force-directed approach is one of the most widely used methods in graph drawing research. There are two main problems with the traditional force-directed algorithms. First, there is no mature theory to ensure the convergence of iteration sequence used in the algorithm and further, it is hard to estimate the rate of convergence even if the convergence is satisfied. Second, the running time cost is increased intolerablely in drawing large- scale graphs, and therefore the advantages of the force-directed approach are limited in practice. This paper is focused on these problems and presents a suff"},"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.01228","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-11-03T16:33:42Z","cross_cats_sorted":[],"title_canon_sha256":"cd6f134c89bdfec579406aed1363af2ba28b34d30c6ed5f4fbe019aa1de0665f","abstract_canon_sha256":"90032d567531edd8fbbeaf5c892d1bbbb716c5500364e57b1463efbacf893844"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:21:40.707675Z","signature_b64":"x8R7wZTel2hi0KtP4+PdkTBvsTxZSkWyy61dxrRW2gR9o2o6PvEdxCPsubKY+dNHHrDZVX9LngA1J3ED9a21Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"057f367871e2e9e892511e947a42af4d673e1af1437b35624f2778d2b503aa0c","last_reissued_at":"2026-05-18T00:21:40.706947Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:21:40.706947Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Fast Successive Over-Relaxation Algorithm for Force-Directed Network Graph Drawing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Yong-Xian Wang, Zheng-Hua Wang","submitted_at":"2017-11-03T16:33:42Z","abstract_excerpt":"Force-directed approach is one of the most widely used methods in graph drawing research. There are two main problems with the traditional force-directed algorithms. First, there is no mature theory to ensure the convergence of iteration sequence used in the algorithm and further, it is hard to estimate the rate of convergence even if the convergence is satisfied. Second, the running time cost is increased intolerablely in drawing large- scale graphs, and therefore the advantages of the force-directed approach are limited in practice. This paper is focused on these problems and presents a suff"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.01228","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1711.01228","created_at":"2026-05-18T00:21:40.707043+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.01228v2","created_at":"2026-05-18T00:21:40.707043+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.01228","created_at":"2026-05-18T00:21:40.707043+00:00"},{"alias_kind":"pith_short_12","alias_value":"AV7TM6DR4LU6","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_16","alias_value":"AV7TM6DR4LU6RESR","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_8","alias_value":"AV7TM6DR","created_at":"2026-05-18T12:31:08.081275+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/AV7TM6DR4LU6RESRD2KHUQVPJV","json":"https://pith.science/pith/AV7TM6DR4LU6RESRD2KHUQVPJV.json","graph_json":"https://pith.science/api/pith-number/AV7TM6DR4LU6RESRD2KHUQVPJV/graph.json","events_json":"https://pith.science/api/pith-number/AV7TM6DR4LU6RESRD2KHUQVPJV/events.json","paper":"https://pith.science/paper/AV7TM6DR"},"agent_actions":{"view_html":"https://pith.science/pith/AV7TM6DR4LU6RESRD2KHUQVPJV","download_json":"https://pith.science/pith/AV7TM6DR4LU6RESRD2KHUQVPJV.json","view_paper":"https://pith.science/paper/AV7TM6DR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.01228&json=true","fetch_graph":"https://pith.science/api/pith-number/AV7TM6DR4LU6RESRD2KHUQVPJV/graph.json","fetch_events":"https://pith.science/api/pith-number/AV7TM6DR4LU6RESRD2KHUQVPJV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AV7TM6DR4LU6RESRD2KHUQVPJV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AV7TM6DR4LU6RESRD2KHUQVPJV/action/storage_attestation","attest_author":"https://pith.science/pith/AV7TM6DR4LU6RESRD2KHUQVPJV/action/author_attestation","sign_citation":"https://pith.science/pith/AV7TM6DR4LU6RESRD2KHUQVPJV/action/citation_signature","submit_replication":"https://pith.science/pith/AV7TM6DR4LU6RESRD2KHUQVPJV/action/replication_record"}},"created_at":"2026-05-18T00:21:40.707043+00:00","updated_at":"2026-05-18T00:21:40.707043+00:00"}