{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:DPGF5ACATF4WTH4YI2W4PRTGAL","short_pith_number":"pith:DPGF5ACA","schema_version":"1.0","canonical_sha256":"1bcc5e80409979699f9846adc7c66602ecdbd3443423d07e2b038ab75bcac552","source":{"kind":"arxiv","id":"1709.00372","version":1},"attestation_state":"computed","paper":{"title":"Drawing Dynamic Graphs Without Timeslices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.HC"],"primary_cat":"cs.SI","authors_text":"Daniel Archambault, Paolo Simonetto, Stephen Kobourov","submitted_at":"2017-09-01T15:45:41Z","abstract_excerpt":"Timeslices are often used to draw and visualize dynamic graphs. While timeslices are a natural way to think about dynamic graphs, they are routinely imposed on continuous data. Often, it is unclear how many timeslices to select: too few timeslices can miss temporal features such as causality or even graph structure while too many timeslices slows the drawing computation. We present a model for dynamic graphs which is not based on timeslices, and a dynamic graph drawing algorithm, DynNoSlice, to draw graphs in this model. In our evaluation, we demonstrate the advantages of this approach over ti"},"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":"1709.00372","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-09-01T15:45:41Z","cross_cats_sorted":["cs.HC"],"title_canon_sha256":"43209dade51a19b1880773eb81433657c9a0ddba833b80e113946ce89fb8e089","abstract_canon_sha256":"29268467902dd7f666984e62f037b36080e151917ad0bfd0f4b239ac39bc6fcc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:10.524651Z","signature_b64":"raCuKI9UXkdnhqycfD4+hXeyGMijKk+Mqt0PXzIoJF9iZR8wFrtxDnzRje5oqjdsnF6+nOyNmskkH5xK8LMoAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1bcc5e80409979699f9846adc7c66602ecdbd3443423d07e2b038ab75bcac552","last_reissued_at":"2026-05-18T00:36:10.524012Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:10.524012Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Drawing Dynamic Graphs Without Timeslices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.HC"],"primary_cat":"cs.SI","authors_text":"Daniel Archambault, Paolo Simonetto, Stephen Kobourov","submitted_at":"2017-09-01T15:45:41Z","abstract_excerpt":"Timeslices are often used to draw and visualize dynamic graphs. While timeslices are a natural way to think about dynamic graphs, they are routinely imposed on continuous data. Often, it is unclear how many timeslices to select: too few timeslices can miss temporal features such as causality or even graph structure while too many timeslices slows the drawing computation. We present a model for dynamic graphs which is not based on timeslices, and a dynamic graph drawing algorithm, DynNoSlice, to draw graphs in this model. In our evaluation, we demonstrate the advantages of this approach over ti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.00372","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":"1709.00372","created_at":"2026-05-18T00:36:10.524130+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.00372v1","created_at":"2026-05-18T00:36:10.524130+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.00372","created_at":"2026-05-18T00:36:10.524130+00:00"},{"alias_kind":"pith_short_12","alias_value":"DPGF5ACATF4W","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_16","alias_value":"DPGF5ACATF4WTH4Y","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_8","alias_value":"DPGF5ACA","created_at":"2026-05-18T12:31:12.930513+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/DPGF5ACATF4WTH4YI2W4PRTGAL","json":"https://pith.science/pith/DPGF5ACATF4WTH4YI2W4PRTGAL.json","graph_json":"https://pith.science/api/pith-number/DPGF5ACATF4WTH4YI2W4PRTGAL/graph.json","events_json":"https://pith.science/api/pith-number/DPGF5ACATF4WTH4YI2W4PRTGAL/events.json","paper":"https://pith.science/paper/DPGF5ACA"},"agent_actions":{"view_html":"https://pith.science/pith/DPGF5ACATF4WTH4YI2W4PRTGAL","download_json":"https://pith.science/pith/DPGF5ACATF4WTH4YI2W4PRTGAL.json","view_paper":"https://pith.science/paper/DPGF5ACA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.00372&json=true","fetch_graph":"https://pith.science/api/pith-number/DPGF5ACATF4WTH4YI2W4PRTGAL/graph.json","fetch_events":"https://pith.science/api/pith-number/DPGF5ACATF4WTH4YI2W4PRTGAL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DPGF5ACATF4WTH4YI2W4PRTGAL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DPGF5ACATF4WTH4YI2W4PRTGAL/action/storage_attestation","attest_author":"https://pith.science/pith/DPGF5ACATF4WTH4YI2W4PRTGAL/action/author_attestation","sign_citation":"https://pith.science/pith/DPGF5ACATF4WTH4YI2W4PRTGAL/action/citation_signature","submit_replication":"https://pith.science/pith/DPGF5ACATF4WTH4YI2W4PRTGAL/action/replication_record"}},"created_at":"2026-05-18T00:36:10.524130+00:00","updated_at":"2026-05-18T00:36:10.524130+00:00"}