{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:IERLCJZERWNYYUHVA4T6EEYQ2H","short_pith_number":"pith:IERLCJZE","schema_version":"1.0","canonical_sha256":"4122b127248d9b8c50f50727e21310d1c2b80865d65515d9032ef41ccfedd0fa","source":{"kind":"arxiv","id":"1504.02687","version":1},"attestation_state":"computed","paper":{"title":"3D Density Histograms for Criteria-driven Edge Bundling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GR","authors_text":"Daniel C. Moura","submitted_at":"2015-04-10T14:13:39Z","abstract_excerpt":"This paper presents a graph bundling algorithm that agglomerates edges taking into account both spatial proximity as well as user-defined criteria in order to reveal patterns that were not perceivable with previous bundling techniques. Each edge belongs to a group that may either be an input of the problem or found by clustering one or more edge properties such as origin, destination, orientation, length or domain-specific properties. Bundling is driven by a stack of density maps, with each map capturing both the edge density of a given group as well as interactions with edges from other group"},"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":"1504.02687","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GR","submitted_at":"2015-04-10T14:13:39Z","cross_cats_sorted":[],"title_canon_sha256":"0bec402ac87a0d025c8566f8a437ac8c64320a55ebaa1682898c483fc0fbb1d1","abstract_canon_sha256":"c516d68f503b3e01b67a792ad3a2526655bcad0f428dacc3c4efd5a015b9f9c7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:19:06.853728Z","signature_b64":"2jMBfvAEVwCuNSx1obiPSi5Bl2NKE7IcLNeZYdl5jamuYEqJ6gh46uViVVZXTt862wTc7bSXukvRXCnlHX72Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4122b127248d9b8c50f50727e21310d1c2b80865d65515d9032ef41ccfedd0fa","last_reissued_at":"2026-05-18T02:19:06.853299Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:19:06.853299Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"3D Density Histograms for Criteria-driven Edge Bundling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GR","authors_text":"Daniel C. Moura","submitted_at":"2015-04-10T14:13:39Z","abstract_excerpt":"This paper presents a graph bundling algorithm that agglomerates edges taking into account both spatial proximity as well as user-defined criteria in order to reveal patterns that were not perceivable with previous bundling techniques. Each edge belongs to a group that may either be an input of the problem or found by clustering one or more edge properties such as origin, destination, orientation, length or domain-specific properties. Bundling is driven by a stack of density maps, with each map capturing both the edge density of a given group as well as interactions with edges from other group"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.02687","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":"1504.02687","created_at":"2026-05-18T02:19:06.853369+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.02687v1","created_at":"2026-05-18T02:19:06.853369+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.02687","created_at":"2026-05-18T02:19:06.853369+00:00"},{"alias_kind":"pith_short_12","alias_value":"IERLCJZERWNY","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_16","alias_value":"IERLCJZERWNYYUHV","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_8","alias_value":"IERLCJZE","created_at":"2026-05-18T12:29:25.134429+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.01395","citing_title":"Impact of inter-city interactions on disease scaling","ref_index":33,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IERLCJZERWNYYUHVA4T6EEYQ2H","json":"https://pith.science/pith/IERLCJZERWNYYUHVA4T6EEYQ2H.json","graph_json":"https://pith.science/api/pith-number/IERLCJZERWNYYUHVA4T6EEYQ2H/graph.json","events_json":"https://pith.science/api/pith-number/IERLCJZERWNYYUHVA4T6EEYQ2H/events.json","paper":"https://pith.science/paper/IERLCJZE"},"agent_actions":{"view_html":"https://pith.science/pith/IERLCJZERWNYYUHVA4T6EEYQ2H","download_json":"https://pith.science/pith/IERLCJZERWNYYUHVA4T6EEYQ2H.json","view_paper":"https://pith.science/paper/IERLCJZE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.02687&json=true","fetch_graph":"https://pith.science/api/pith-number/IERLCJZERWNYYUHVA4T6EEYQ2H/graph.json","fetch_events":"https://pith.science/api/pith-number/IERLCJZERWNYYUHVA4T6EEYQ2H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IERLCJZERWNYYUHVA4T6EEYQ2H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IERLCJZERWNYYUHVA4T6EEYQ2H/action/storage_attestation","attest_author":"https://pith.science/pith/IERLCJZERWNYYUHVA4T6EEYQ2H/action/author_attestation","sign_citation":"https://pith.science/pith/IERLCJZERWNYYUHVA4T6EEYQ2H/action/citation_signature","submit_replication":"https://pith.science/pith/IERLCJZERWNYYUHVA4T6EEYQ2H/action/replication_record"}},"created_at":"2026-05-18T02:19:06.853369+00:00","updated_at":"2026-05-18T02:19:06.853369+00:00"}