{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:46ZEDQBO67B52QOJDCVQNKKIJD","short_pith_number":"pith:46ZEDQBO","schema_version":"1.0","canonical_sha256":"e7b241c02ef7c3dd41c918ab06a94848c1cde0b00daba30768f507f37f571a45","source":{"kind":"arxiv","id":"1308.0309","version":2},"attestation_state":"computed","paper":{"title":"Fast filtering and animation of large dynamic networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CY","physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Filippo Menczer, Luca Maria Aiello, Przemyslaw A. Grabowicz","submitted_at":"2013-08-01T19:29:28Z","abstract_excerpt":"Detecting and visualizing what are the most relevant changes in an evolving network is an open challenge in several domains. We present a fast algorithm that filters subsets of the strongest nodes and edges representing an evolving weighted graph and visualize it by either creating a movie, or by streaming it to an interactive network visualization tool. The algorithm is an approximation of exponential sliding time-window that scales linearly with the number of interactions. We compare the algorithm against rectangular and exponential sliding time-window methods. Our network filtering algorith"},"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":"1308.0309","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2013-08-01T19:29:28Z","cross_cats_sorted":["cs.CY","physics.soc-ph"],"title_canon_sha256":"a161497957b814a891a8972f6d7a28b124e21dc9998e96a0801c6b4712e01a23","abstract_canon_sha256":"998518c613215660bbd71064844be49f2049d5db606356da47673d982005bfb7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:38:44.557182Z","signature_b64":"CA8XiyhdxTeEXc4jUbBZZJrRhnrRN69UBsedm2KmOnUmfwmQ1MxNFgLcmGRnSJutg6G+CkTW/StmgztFcQiFAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e7b241c02ef7c3dd41c918ab06a94848c1cde0b00daba30768f507f37f571a45","last_reissued_at":"2026-05-18T02:38:44.556769Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:38:44.556769Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast filtering and animation of large dynamic networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CY","physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Filippo Menczer, Luca Maria Aiello, Przemyslaw A. Grabowicz","submitted_at":"2013-08-01T19:29:28Z","abstract_excerpt":"Detecting and visualizing what are the most relevant changes in an evolving network is an open challenge in several domains. We present a fast algorithm that filters subsets of the strongest nodes and edges representing an evolving weighted graph and visualize it by either creating a movie, or by streaming it to an interactive network visualization tool. The algorithm is an approximation of exponential sliding time-window that scales linearly with the number of interactions. We compare the algorithm against rectangular and exponential sliding time-window methods. Our network filtering algorith"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.0309","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":"1308.0309","created_at":"2026-05-18T02:38:44.556830+00:00"},{"alias_kind":"arxiv_version","alias_value":"1308.0309v2","created_at":"2026-05-18T02:38:44.556830+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.0309","created_at":"2026-05-18T02:38:44.556830+00:00"},{"alias_kind":"pith_short_12","alias_value":"46ZEDQBO67B5","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_16","alias_value":"46ZEDQBO67B52QOJ","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_8","alias_value":"46ZEDQBO","created_at":"2026-05-18T12:27:32.513160+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/46ZEDQBO67B52QOJDCVQNKKIJD","json":"https://pith.science/pith/46ZEDQBO67B52QOJDCVQNKKIJD.json","graph_json":"https://pith.science/api/pith-number/46ZEDQBO67B52QOJDCVQNKKIJD/graph.json","events_json":"https://pith.science/api/pith-number/46ZEDQBO67B52QOJDCVQNKKIJD/events.json","paper":"https://pith.science/paper/46ZEDQBO"},"agent_actions":{"view_html":"https://pith.science/pith/46ZEDQBO67B52QOJDCVQNKKIJD","download_json":"https://pith.science/pith/46ZEDQBO67B52QOJDCVQNKKIJD.json","view_paper":"https://pith.science/paper/46ZEDQBO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1308.0309&json=true","fetch_graph":"https://pith.science/api/pith-number/46ZEDQBO67B52QOJDCVQNKKIJD/graph.json","fetch_events":"https://pith.science/api/pith-number/46ZEDQBO67B52QOJDCVQNKKIJD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/46ZEDQBO67B52QOJDCVQNKKIJD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/46ZEDQBO67B52QOJDCVQNKKIJD/action/storage_attestation","attest_author":"https://pith.science/pith/46ZEDQBO67B52QOJDCVQNKKIJD/action/author_attestation","sign_citation":"https://pith.science/pith/46ZEDQBO67B52QOJDCVQNKKIJD/action/citation_signature","submit_replication":"https://pith.science/pith/46ZEDQBO67B52QOJDCVQNKKIJD/action/replication_record"}},"created_at":"2026-05-18T02:38:44.556830+00:00","updated_at":"2026-05-18T02:38:44.556830+00:00"}