{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:3KU24FYUQSB26QVSI4W2DTL6NJ","short_pith_number":"pith:3KU24FYU","canonical_record":{"source":{"id":"1209.5791","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-09-25T23:25:03Z","cross_cats_sorted":[],"title_canon_sha256":"40ff6423f0e88482e7d1240ee7d97b03a69df799e4abbc873ab4aadd30cf0cb1","abstract_canon_sha256":"9934468120303c5a4255307074a877371de81b4a85255e37c57bf26affcb8477"},"schema_version":"1.0"},"canonical_sha256":"daa9ae17148483af42b2472da1cd7e6a60cd26d78cbf9f7c30540312314a7c15","source":{"kind":"arxiv","id":"1209.5791","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.5791","created_at":"2026-05-18T03:44:46Z"},{"alias_kind":"arxiv_version","alias_value":"1209.5791v1","created_at":"2026-05-18T03:44:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.5791","created_at":"2026-05-18T03:44:46Z"},{"alias_kind":"pith_short_12","alias_value":"3KU24FYUQSB2","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"3KU24FYUQSB26QVS","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"3KU24FYU","created_at":"2026-05-18T12:26:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:3KU24FYUQSB26QVSI4W2DTL6NJ","target":"record","payload":{"canonical_record":{"source":{"id":"1209.5791","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-09-25T23:25:03Z","cross_cats_sorted":[],"title_canon_sha256":"40ff6423f0e88482e7d1240ee7d97b03a69df799e4abbc873ab4aadd30cf0cb1","abstract_canon_sha256":"9934468120303c5a4255307074a877371de81b4a85255e37c57bf26affcb8477"},"schema_version":"1.0"},"canonical_sha256":"daa9ae17148483af42b2472da1cd7e6a60cd26d78cbf9f7c30540312314a7c15","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:44:46.383640Z","signature_b64":"yiHTpkCWcQ+2SdHbiByWhls55tzZsj+wKL+UjX62l1vC4+9iGcrG3JFhebplny+9A9jL/PAdLeJ65DmaUowBCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"daa9ae17148483af42b2472da1cd7e6a60cd26d78cbf9f7c30540312314a7c15","last_reissued_at":"2026-05-18T03:44:46.382806Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:44:46.382806Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1209.5791","source_version":1,"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-18T03:44:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z/CFR1dKebqPj4wEu2tJ7hJKiJ7bHOjEy7RJyC55eaaxacPIQCfZt/rvusmOqrSA8zd4krA1XwUFo05RQH7cDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T04:56:23.288095Z"},"content_sha256":"a6113535f9326dfb572fa2e13b3456ea003c01cd98cb15508d2a3aa3ccc2e463","schema_version":"1.0","event_id":"sha256:a6113535f9326dfb572fa2e13b3456ea003c01cd98cb15508d2a3aa3ccc2e463"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:3KU24FYUQSB26QVSI4W2DTL6NJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Windows into Relational Events: Data Structures for Contiguous Subsequences of Edges","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Christopher DuBois, David Eppstein, Michael J. Bannister, Padhraic Smyth","submitted_at":"2012-09-25T23:25:03Z","abstract_excerpt":"We consider the problem of analyzing social network data sets in which the edges of the network have timestamps, and we wish to analyze the subgraphs formed from edges in contiguous subintervals of these timestamps. We provide data structures for these problems that use near-linear preprocessing time, linear space, and sublogarithmic query time to handle queries that ask for the number of connected components, number of components that contain cycles, number of vertices whose degree equals or is at most some predetermined value, number of vertices that can be reached from a starting set of ver"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.5791","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"},"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-18T03:44:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MLaHHT1YE4uUvHcG80ZNDvBLdECGx4nwxxDw/d2VgLfZVh8ro6yndNHjGDLf7zipfI9DPyqVIw4WizHpy80bBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T04:56:23.288566Z"},"content_sha256":"9c1a478b339ded0e8294efe92df856de8b1fa103a473a95953e47fc1a1203454","schema_version":"1.0","event_id":"sha256:9c1a478b339ded0e8294efe92df856de8b1fa103a473a95953e47fc1a1203454"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3KU24FYUQSB26QVSI4W2DTL6NJ/bundle.json","state_url":"https://pith.science/pith/3KU24FYUQSB26QVSI4W2DTL6NJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3KU24FYUQSB26QVSI4W2DTL6NJ/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-08-13T04:56:23Z","links":{"resolver":"https://pith.science/pith/3KU24FYUQSB26QVSI4W2DTL6NJ","bundle":"https://pith.science/pith/3KU24FYUQSB26QVSI4W2DTL6NJ/bundle.json","state":"https://pith.science/pith/3KU24FYUQSB26QVSI4W2DTL6NJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3KU24FYUQSB26QVSI4W2DTL6NJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:3KU24FYUQSB26QVSI4W2DTL6NJ","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":"9934468120303c5a4255307074a877371de81b4a85255e37c57bf26affcb8477","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-09-25T23:25:03Z","title_canon_sha256":"40ff6423f0e88482e7d1240ee7d97b03a69df799e4abbc873ab4aadd30cf0cb1"},"schema_version":"1.0","source":{"id":"1209.5791","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.5791","created_at":"2026-05-18T03:44:46Z"},{"alias_kind":"arxiv_version","alias_value":"1209.5791v1","created_at":"2026-05-18T03:44:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.5791","created_at":"2026-05-18T03:44:46Z"},{"alias_kind":"pith_short_12","alias_value":"3KU24FYUQSB2","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"3KU24FYUQSB26QVS","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"3KU24FYU","created_at":"2026-05-18T12:26:50Z"}],"graph_snapshots":[{"event_id":"sha256:9c1a478b339ded0e8294efe92df856de8b1fa103a473a95953e47fc1a1203454","target":"graph","created_at":"2026-05-18T03:44:46Z","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":"We consider the problem of analyzing social network data sets in which the edges of the network have timestamps, and we wish to analyze the subgraphs formed from edges in contiguous subintervals of these timestamps. We provide data structures for these problems that use near-linear preprocessing time, linear space, and sublogarithmic query time to handle queries that ask for the number of connected components, number of components that contain cycles, number of vertices whose degree equals or is at most some predetermined value, number of vertices that can be reached from a starting set of ver","authors_text":"Christopher DuBois, David Eppstein, Michael J. Bannister, Padhraic Smyth","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-09-25T23:25:03Z","title":"Windows into Relational Events: Data Structures for Contiguous Subsequences of Edges"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.5791","kind":"arxiv","version":1},"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:a6113535f9326dfb572fa2e13b3456ea003c01cd98cb15508d2a3aa3ccc2e463","target":"record","created_at":"2026-05-18T03:44:46Z","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":"9934468120303c5a4255307074a877371de81b4a85255e37c57bf26affcb8477","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-09-25T23:25:03Z","title_canon_sha256":"40ff6423f0e88482e7d1240ee7d97b03a69df799e4abbc873ab4aadd30cf0cb1"},"schema_version":"1.0","source":{"id":"1209.5791","kind":"arxiv","version":1}},"canonical_sha256":"daa9ae17148483af42b2472da1cd7e6a60cd26d78cbf9f7c30540312314a7c15","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"daa9ae17148483af42b2472da1cd7e6a60cd26d78cbf9f7c30540312314a7c15","first_computed_at":"2026-05-18T03:44:46.382806Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:44:46.382806Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yiHTpkCWcQ+2SdHbiByWhls55tzZsj+wKL+UjX62l1vC4+9iGcrG3JFhebplny+9A9jL/PAdLeJ65DmaUowBCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:44:46.383640Z","signed_message":"canonical_sha256_bytes"},"source_id":"1209.5791","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a6113535f9326dfb572fa2e13b3456ea003c01cd98cb15508d2a3aa3ccc2e463","sha256:9c1a478b339ded0e8294efe92df856de8b1fa103a473a95953e47fc1a1203454"],"state_sha256":"cff73b7444733c448a8ca4aed2049c33b9496a2b2d9626dc5621b3187ef58f06"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/u5bBj6BHIsyBZZ04lY+00Be0wZIaiw2c9O7tX28VRgjS+ee+w12urPMLG7C9a8hbp2lLm2MeJywsOhSqHu6AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T04:56:23.292447Z","bundle_sha256":"9be2c13120d13fbe7366277ab184433bcd39e4b9884a82ec3e0febdd1276205a"}}