{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:QTQGDJSCIMBAU5CKVF6NRZIJXD","short_pith_number":"pith:QTQGDJSC","schema_version":"1.0","canonical_sha256":"84e061a64243020a744aa97cd8e509b8e9c391afecb93f49a7f871ab2909891b","source":{"kind":"arxiv","id":"1703.07729","version":1},"attestation_state":"computed","paper":{"title":"Graffinity: Visualizing Connectivity In Large Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.HC"],"primary_cat":"cs.GR","authors_text":"Alexander Lex, Bryan William Jones, Crystal Lynn Sigulinsky, Ethan Kerzner, Miriah Meyer, Robert E. Marc, Timothy Urness","submitted_at":"2017-03-22T16:23:32Z","abstract_excerpt":"Multivariate graphs are prolific across many fields, including transportation and neuroscience. A key task in graph analysis is the exploration of connectivity, to, for example, analyze how signals flow through neurons, or to explore how well different cities are connected by flights. While standard node-link diagrams are helpful in judging connectivity, they do not scale to large networks. Adjacency matrices also do not scale to large networks and are only suitable to judge connectivity of adjacent nodes. A key approach to realize scalable graph visualization are queries: instead of displayin"},"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":"1703.07729","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GR","submitted_at":"2017-03-22T16:23:32Z","cross_cats_sorted":["cs.HC"],"title_canon_sha256":"bb28065a2edf4fbbc44fb07dbd8f5e4a41e7ea0b9a9c1ee7e0e61b6a0bb53c0f","abstract_canon_sha256":"ce3e8257a7f18960f7d16b439adc18b0fb2a7252202bdc7e9a437424d4fa9b99"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:06.291961Z","signature_b64":"H9d2O9vkoYPGgr+ZEH9WWRMiVLxFzedv+xfAzRwC6CcbHWU9vJ6MbLYUPc/xtWpo2GAgMoj70L5d3UpHTkf8CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"84e061a64243020a744aa97cd8e509b8e9c391afecb93f49a7f871ab2909891b","last_reissued_at":"2026-05-18T00:48:06.291131Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:06.291131Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graffinity: Visualizing Connectivity In Large Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.HC"],"primary_cat":"cs.GR","authors_text":"Alexander Lex, Bryan William Jones, Crystal Lynn Sigulinsky, Ethan Kerzner, Miriah Meyer, Robert E. Marc, Timothy Urness","submitted_at":"2017-03-22T16:23:32Z","abstract_excerpt":"Multivariate graphs are prolific across many fields, including transportation and neuroscience. A key task in graph analysis is the exploration of connectivity, to, for example, analyze how signals flow through neurons, or to explore how well different cities are connected by flights. While standard node-link diagrams are helpful in judging connectivity, they do not scale to large networks. Adjacency matrices also do not scale to large networks and are only suitable to judge connectivity of adjacent nodes. A key approach to realize scalable graph visualization are queries: instead of displayin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.07729","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":"1703.07729","created_at":"2026-05-18T00:48:06.291284+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.07729v1","created_at":"2026-05-18T00:48:06.291284+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.07729","created_at":"2026-05-18T00:48:06.291284+00:00"},{"alias_kind":"pith_short_12","alias_value":"QTQGDJSCIMBA","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_16","alias_value":"QTQGDJSCIMBAU5CK","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_8","alias_value":"QTQGDJSC","created_at":"2026-05-18T12:31:39.905425+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/QTQGDJSCIMBAU5CKVF6NRZIJXD","json":"https://pith.science/pith/QTQGDJSCIMBAU5CKVF6NRZIJXD.json","graph_json":"https://pith.science/api/pith-number/QTQGDJSCIMBAU5CKVF6NRZIJXD/graph.json","events_json":"https://pith.science/api/pith-number/QTQGDJSCIMBAU5CKVF6NRZIJXD/events.json","paper":"https://pith.science/paper/QTQGDJSC"},"agent_actions":{"view_html":"https://pith.science/pith/QTQGDJSCIMBAU5CKVF6NRZIJXD","download_json":"https://pith.science/pith/QTQGDJSCIMBAU5CKVF6NRZIJXD.json","view_paper":"https://pith.science/paper/QTQGDJSC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.07729&json=true","fetch_graph":"https://pith.science/api/pith-number/QTQGDJSCIMBAU5CKVF6NRZIJXD/graph.json","fetch_events":"https://pith.science/api/pith-number/QTQGDJSCIMBAU5CKVF6NRZIJXD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QTQGDJSCIMBAU5CKVF6NRZIJXD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QTQGDJSCIMBAU5CKVF6NRZIJXD/action/storage_attestation","attest_author":"https://pith.science/pith/QTQGDJSCIMBAU5CKVF6NRZIJXD/action/author_attestation","sign_citation":"https://pith.science/pith/QTQGDJSCIMBAU5CKVF6NRZIJXD/action/citation_signature","submit_replication":"https://pith.science/pith/QTQGDJSCIMBAU5CKVF6NRZIJXD/action/replication_record"}},"created_at":"2026-05-18T00:48:06.291284+00:00","updated_at":"2026-05-18T00:48:06.291284+00:00"}