{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:UPU7FOIAMECCPPK3VEXDVYAOT6","short_pith_number":"pith:UPU7FOIA","schema_version":"1.0","canonical_sha256":"a3e9f2b900610427bd5ba92e3ae00e9fb2991d5cad5fd7c95d850a359facb6a4","source":{"kind":"arxiv","id":"1708.08659","version":2},"attestation_state":"computed","paper":{"title":"Drawing Big Graphs using Spectral Sparsification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.CG","authors_text":"Peter Eades, Quan Nguyen, Seok-Hee Hong","submitted_at":"2017-08-29T09:36:54Z","abstract_excerpt":"Spectral sparsification is a general technique developed by Spielman et al. to reduce the number of edges in a graph while retaining its structural properties. We investigate the use of spectral sparsification to produce good visual representations of big graphs. We evaluate spectral sparsification approaches on real-world and synthetic graphs. We show that spectral sparsifiers are more effective than random edge sampling. Our results lead to guidelines for using spectral sparsification in big graph visualization."},"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":"1708.08659","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-08-29T09:36:54Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"0690a2c6b7b42208fa870f2c9c88f256903422d3be9db519cb4e3b655149d0f9","abstract_canon_sha256":"f299b39513272a35723502baf10a42a43eb06019df90426b1b584d5f7e5bea56"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:21.657359Z","signature_b64":"TtJBfTM491DNq3KifmVb9Aew9LKXh0/Wr0BgSjLVoiXG3pWk08QJcD4gIG3YEnzZklXLVVFCeBvoRURd79c1Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a3e9f2b900610427bd5ba92e3ae00e9fb2991d5cad5fd7c95d850a359facb6a4","last_reissued_at":"2026-05-18T00:36:21.656762Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:21.656762Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Drawing Big Graphs using Spectral Sparsification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.CG","authors_text":"Peter Eades, Quan Nguyen, Seok-Hee Hong","submitted_at":"2017-08-29T09:36:54Z","abstract_excerpt":"Spectral sparsification is a general technique developed by Spielman et al. to reduce the number of edges in a graph while retaining its structural properties. We investigate the use of spectral sparsification to produce good visual representations of big graphs. We evaluate spectral sparsification approaches on real-world and synthetic graphs. We show that spectral sparsifiers are more effective than random edge sampling. Our results lead to guidelines for using spectral sparsification in big graph visualization."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.08659","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":"1708.08659","created_at":"2026-05-18T00:36:21.656839+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.08659v2","created_at":"2026-05-18T00:36:21.656839+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.08659","created_at":"2026-05-18T00:36:21.656839+00:00"},{"alias_kind":"pith_short_12","alias_value":"UPU7FOIAMECC","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_16","alias_value":"UPU7FOIAMECCPPK3","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_8","alias_value":"UPU7FOIA","created_at":"2026-05-18T12:31:46.661854+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/UPU7FOIAMECCPPK3VEXDVYAOT6","json":"https://pith.science/pith/UPU7FOIAMECCPPK3VEXDVYAOT6.json","graph_json":"https://pith.science/api/pith-number/UPU7FOIAMECCPPK3VEXDVYAOT6/graph.json","events_json":"https://pith.science/api/pith-number/UPU7FOIAMECCPPK3VEXDVYAOT6/events.json","paper":"https://pith.science/paper/UPU7FOIA"},"agent_actions":{"view_html":"https://pith.science/pith/UPU7FOIAMECCPPK3VEXDVYAOT6","download_json":"https://pith.science/pith/UPU7FOIAMECCPPK3VEXDVYAOT6.json","view_paper":"https://pith.science/paper/UPU7FOIA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.08659&json=true","fetch_graph":"https://pith.science/api/pith-number/UPU7FOIAMECCPPK3VEXDVYAOT6/graph.json","fetch_events":"https://pith.science/api/pith-number/UPU7FOIAMECCPPK3VEXDVYAOT6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UPU7FOIAMECCPPK3VEXDVYAOT6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UPU7FOIAMECCPPK3VEXDVYAOT6/action/storage_attestation","attest_author":"https://pith.science/pith/UPU7FOIAMECCPPK3VEXDVYAOT6/action/author_attestation","sign_citation":"https://pith.science/pith/UPU7FOIAMECCPPK3VEXDVYAOT6/action/citation_signature","submit_replication":"https://pith.science/pith/UPU7FOIAMECCPPK3VEXDVYAOT6/action/replication_record"}},"created_at":"2026-05-18T00:36:21.656839+00:00","updated_at":"2026-05-18T00:36:21.656839+00:00"}