{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:UWPES2VTPJHIM5OBQYNGKJNKIZ","short_pith_number":"pith:UWPES2VT","schema_version":"1.0","canonical_sha256":"a59e496ab37a4e8675c1861a6525aa467acfc6ca97f004eb75ee087ffe152631","source":{"kind":"arxiv","id":"2608.01907","version":1},"attestation_state":"computed","paper":{"title":"SNAP-tFDP: Massively Scalable Graph Layouts via Sparse Negative Sampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GR","authors_text":"Mingliang Xue, Oliver Deussen, Shuowei Hou, Weidong Huang, Xin Chen, Yifan Wang, Yunhai Wang, Zezheng Feng","submitted_at":"2026-08-03T08:40:43Z","abstract_excerpt":"Force-Directed Placement (FDP) is a widely used approach for network visualization, yet scaling it to massive graphs while preserving clear community structures remains a major computational and visual challenge. Existing approximation methods often rely on auxiliary data structures (e.g., spatial trees), which introduce substantial memory overhead; furthermore, traditional power-function-based forces frequently fail to separate dense clusters effectively. In this paper, we present a negative sampling-based algorithm that achieves O(|E|) time complexity with a low memory footprint, without req"},"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":"2608.01907","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GR","submitted_at":"2026-08-03T08:40:43Z","cross_cats_sorted":[],"title_canon_sha256":"760fe1b66f172e7bfc4a5d6b87ed8f807a0a224f52991a63863c4abd17bfbf90","abstract_canon_sha256":"73efafe194b1eaab8634dc0da8407a9e1fa8272e8eddcc52393f6e2a4510d9d8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-04T02:07:36.554768Z","signature_b64":"mDrv97VE0lSbk94l+jMLinvjJIrFN8AZyyjWrEoGgk8CGGVeIYyEUABQgD/MK1P70CKLPLl236Wrk2w9kcr9AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a59e496ab37a4e8675c1861a6525aa467acfc6ca97f004eb75ee087ffe152631","last_reissued_at":"2026-08-04T02:07:36.552853Z","signature_status":"signed_v1","first_computed_at":"2026-08-04T02:07:36.552853Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"SNAP-tFDP: Massively Scalable Graph Layouts via Sparse Negative Sampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GR","authors_text":"Mingliang Xue, Oliver Deussen, Shuowei Hou, Weidong Huang, Xin Chen, Yifan Wang, Yunhai Wang, Zezheng Feng","submitted_at":"2026-08-03T08:40:43Z","abstract_excerpt":"Force-Directed Placement (FDP) is a widely used approach for network visualization, yet scaling it to massive graphs while preserving clear community structures remains a major computational and visual challenge. Existing approximation methods often rely on auxiliary data structures (e.g., spatial trees), which introduce substantial memory overhead; furthermore, traditional power-function-based forces frequently fail to separate dense clusters effectively. In this paper, we present a negative sampling-based algorithm that achieves O(|E|) time complexity with a low memory footprint, without req"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.01907","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2608.01907/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2608.01907","created_at":"2026-08-04T02:07:36.554568+00:00"},{"alias_kind":"arxiv_version","alias_value":"2608.01907v1","created_at":"2026-08-04T02:07:36.554568+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.01907","created_at":"2026-08-04T02:07:36.554568+00:00"},{"alias_kind":"pith_short_12","alias_value":"UWPES2VTPJHI","created_at":"2026-08-04T02:07:36.554568+00:00"},{"alias_kind":"pith_short_16","alias_value":"UWPES2VTPJHIM5OB","created_at":"2026-08-04T02:07:36.554568+00:00"},{"alias_kind":"pith_short_8","alias_value":"UWPES2VT","created_at":"2026-08-04T02:07:36.554568+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/UWPES2VTPJHIM5OBQYNGKJNKIZ","json":"https://pith.science/pith/UWPES2VTPJHIM5OBQYNGKJNKIZ.json","graph_json":"https://pith.science/api/pith-number/UWPES2VTPJHIM5OBQYNGKJNKIZ/graph.json","events_json":"https://pith.science/api/pith-number/UWPES2VTPJHIM5OBQYNGKJNKIZ/events.json","paper":"https://pith.science/paper/UWPES2VT"},"agent_actions":{"view_html":"https://pith.science/pith/UWPES2VTPJHIM5OBQYNGKJNKIZ","download_json":"https://pith.science/pith/UWPES2VTPJHIM5OBQYNGKJNKIZ.json","view_paper":"https://pith.science/paper/UWPES2VT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2608.01907&json=true","fetch_graph":"https://pith.science/api/pith-number/UWPES2VTPJHIM5OBQYNGKJNKIZ/graph.json","fetch_events":"https://pith.science/api/pith-number/UWPES2VTPJHIM5OBQYNGKJNKIZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UWPES2VTPJHIM5OBQYNGKJNKIZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UWPES2VTPJHIM5OBQYNGKJNKIZ/action/storage_attestation","attest_author":"https://pith.science/pith/UWPES2VTPJHIM5OBQYNGKJNKIZ/action/author_attestation","sign_citation":"https://pith.science/pith/UWPES2VTPJHIM5OBQYNGKJNKIZ/action/citation_signature","submit_replication":"https://pith.science/pith/UWPES2VTPJHIM5OBQYNGKJNKIZ/action/replication_record"}},"created_at":"2026-08-04T02:07:36.554568+00:00","updated_at":"2026-08-04T02:07:36.554568+00:00"}