{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:46ZEDQBO67B52QOJDCVQNKKIJD","short_pith_number":"pith:46ZEDQBO","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"},"canonical_sha256":"e7b241c02ef7c3dd41c918ab06a94848c1cde0b00daba30768f507f37f571a45","source":{"kind":"arxiv","id":"1308.0309","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.0309","created_at":"2026-05-18T02:38:44Z"},{"alias_kind":"arxiv_version","alias_value":"1308.0309v2","created_at":"2026-05-18T02:38:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.0309","created_at":"2026-05-18T02:38:44Z"},{"alias_kind":"pith_short_12","alias_value":"46ZEDQBO67B5","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"46ZEDQBO67B52QOJ","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"46ZEDQBO","created_at":"2026-05-18T12:27:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:46ZEDQBO67B52QOJDCVQNKKIJD","target":"record","payload":{"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"},"canonical_sha256":"e7b241c02ef7c3dd41c918ab06a94848c1cde0b00daba30768f507f37f571a45","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"},"source_kind":"arxiv","source_id":"1308.0309","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:38:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8Zu44Ng7xKoEtXyslaEiK5fEcKoI99ZxjRo4HnQvYZtbXPj/o04UXy6NUGoyILhLcG3QY0pNiUF/Ihc2s8mhDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T17:00:17.204425Z"},"content_sha256":"4b629508c1da9031b195a1e87918a5a5ece8a9a9ab42a771020ba739b76a758f","schema_version":"1.0","event_id":"sha256:4b629508c1da9031b195a1e87918a5a5ece8a9a9ab42a771020ba739b76a758f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:46ZEDQBO67B52QOJDCVQNKKIJD","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:38:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zNKGb+qHi9YrIy9nXh59cOzkOKwFjjkIHBSiPjMe69vXINJsarZkeQ4Xc581W5xgPFKLBlAs5BVUvt4uhO83Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T17:00:17.204845Z"},"content_sha256":"b8d4eb2319877b455e5e48ea7ea240006b16c61186737da2ab90843cf9213925","schema_version":"1.0","event_id":"sha256:b8d4eb2319877b455e5e48ea7ea240006b16c61186737da2ab90843cf9213925"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/46ZEDQBO67B52QOJDCVQNKKIJD/bundle.json","state_url":"https://pith.science/pith/46ZEDQBO67B52QOJDCVQNKKIJD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/46ZEDQBO67B52QOJDCVQNKKIJD/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-30T17:00:17Z","links":{"resolver":"https://pith.science/pith/46ZEDQBO67B52QOJDCVQNKKIJD","bundle":"https://pith.science/pith/46ZEDQBO67B52QOJDCVQNKKIJD/bundle.json","state":"https://pith.science/pith/46ZEDQBO67B52QOJDCVQNKKIJD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/46ZEDQBO67B52QOJDCVQNKKIJD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:46ZEDQBO67B52QOJDCVQNKKIJD","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"998518c613215660bbd71064844be49f2049d5db606356da47673d982005bfb7","cross_cats_sorted":["cs.CY","physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2013-08-01T19:29:28Z","title_canon_sha256":"a161497957b814a891a8972f6d7a28b124e21dc9998e96a0801c6b4712e01a23"},"schema_version":"1.0","source":{"id":"1308.0309","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.0309","created_at":"2026-05-18T02:38:44Z"},{"alias_kind":"arxiv_version","alias_value":"1308.0309v2","created_at":"2026-05-18T02:38:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.0309","created_at":"2026-05-18T02:38:44Z"},{"alias_kind":"pith_short_12","alias_value":"46ZEDQBO67B5","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"46ZEDQBO67B52QOJ","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"46ZEDQBO","created_at":"2026-05-18T12:27:32Z"}],"graph_snapshots":[{"event_id":"sha256:b8d4eb2319877b455e5e48ea7ea240006b16c61186737da2ab90843cf9213925","target":"graph","created_at":"2026-05-18T02:38:44Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Filippo Menczer, Luca Maria Aiello, Przemyslaw A. Grabowicz","cross_cats":["cs.CY","physics.soc-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2013-08-01T19:29:28Z","title":"Fast filtering and animation of large dynamic networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.0309","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:4b629508c1da9031b195a1e87918a5a5ece8a9a9ab42a771020ba739b76a758f","target":"record","created_at":"2026-05-18T02:38:44Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"998518c613215660bbd71064844be49f2049d5db606356da47673d982005bfb7","cross_cats_sorted":["cs.CY","physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2013-08-01T19:29:28Z","title_canon_sha256":"a161497957b814a891a8972f6d7a28b124e21dc9998e96a0801c6b4712e01a23"},"schema_version":"1.0","source":{"id":"1308.0309","kind":"arxiv","version":2}},"canonical_sha256":"e7b241c02ef7c3dd41c918ab06a94848c1cde0b00daba30768f507f37f571a45","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e7b241c02ef7c3dd41c918ab06a94848c1cde0b00daba30768f507f37f571a45","first_computed_at":"2026-05-18T02:38:44.556769Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:38:44.556769Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CA8XiyhdxTeEXc4jUbBZZJrRhnrRN69UBsedm2KmOnUmfwmQ1MxNFgLcmGRnSJutg6G+CkTW/StmgztFcQiFAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:38:44.557182Z","signed_message":"canonical_sha256_bytes"},"source_id":"1308.0309","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4b629508c1da9031b195a1e87918a5a5ece8a9a9ab42a771020ba739b76a758f","sha256:b8d4eb2319877b455e5e48ea7ea240006b16c61186737da2ab90843cf9213925"],"state_sha256":"cb91cdbd0069c16d3290937dd22d4208e431dee08963a137e265f85c48cbd6ad"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TdkVv5D2hkaBHIuUZlTggbj4nJdVHG6oq0HDk5SrnzqcBXNPi22q+TOumQeugSWnnt3ntM8M/mvqtUU/+bJdDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T17:00:17.207777Z","bundle_sha256":"56e7e9515fa7a891586484ac979c05beadebeb6e92f282a4a8eab8f9e19d23e4"}}