{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:3J6EMRFK36RJYQIET2HISCKPLB","short_pith_number":"pith:3J6EMRFK","canonical_record":{"source":{"id":"1801.09240","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2018-01-28T14:43:04Z","cross_cats_sorted":[],"title_canon_sha256":"c8ba7a17d647acade5144eb9530746e3ef2a51051875c552c5131b4b75978270","abstract_canon_sha256":"53ea0291b7c51ee5b956a9760d958c60b944a19cdb9f9796353b7819409ea0be"},"schema_version":"1.0"},"canonical_sha256":"da7c4644aadfa29c41049e8e89094f58644df6c2df0ddebefec6bdc1b9008f5a","source":{"kind":"arxiv","id":"1801.09240","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.09240","created_at":"2026-05-18T00:06:40Z"},{"alias_kind":"arxiv_version","alias_value":"1801.09240v3","created_at":"2026-05-18T00:06:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.09240","created_at":"2026-05-18T00:06:40Z"},{"alias_kind":"pith_short_12","alias_value":"3J6EMRFK36RJ","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"3J6EMRFK36RJYQIE","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"3J6EMRFK","created_at":"2026-05-18T12:32:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:3J6EMRFK36RJYQIET2HISCKPLB","target":"record","payload":{"canonical_record":{"source":{"id":"1801.09240","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2018-01-28T14:43:04Z","cross_cats_sorted":[],"title_canon_sha256":"c8ba7a17d647acade5144eb9530746e3ef2a51051875c552c5131b4b75978270","abstract_canon_sha256":"53ea0291b7c51ee5b956a9760d958c60b944a19cdb9f9796353b7819409ea0be"},"schema_version":"1.0"},"canonical_sha256":"da7c4644aadfa29c41049e8e89094f58644df6c2df0ddebefec6bdc1b9008f5a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:40.756935Z","signature_b64":"EbaeTx2TN6uirww/Xgq2dNcweTtkLoWoIxvLalMrgXMsTkOKbFrd+TK3OGVQc2ZXVzDueGjD0yTHMEKZ5YUfBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"da7c4644aadfa29c41049e8e89094f58644df6c2df0ddebefec6bdc1b9008f5a","last_reissued_at":"2026-05-18T00:06:40.756466Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:40.756466Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.09240","source_version":3,"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-18T00:06:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Edmta0Fm9xjWnLRwgEXDtUFr/Erlel9oslJzLZ3t5Cj1zd3M2V9OnRbgmzTwVm9SbMtG58BcEMMmuRlZl82+Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T17:45:19.076014Z"},"content_sha256":"8ac4abe5d114a3d13143dee6e025b7e3da39be6a78ab41c8b4827daa5af3d693","schema_version":"1.0","event_id":"sha256:8ac4abe5d114a3d13143dee6e025b7e3da39be6a78ab41c8b4827daa5af3d693"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:3J6EMRFK36RJYQIET2HISCKPLB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Time Constrained Continuous Subgraph Search over Streaming Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Dongyan Zhao, Lei Zou, M. Tamer Ozsu, Youhuan Li","submitted_at":"2018-01-28T14:43:04Z","abstract_excerpt":"The growing popularity of dynamic applications such as social networks provides a promising way to detect valuable information in real time. Efficient analysis over high-speed data from dynamic applications is of great significance. Data from these dynamic applications can be easily modeled as streaming graph. In this paper, we study the subgraph (isomorphism) search over streaming graph data that obeys timing order constraints over the occurrence of edges in the stream. We propose a data structure and algorithm to efficiently answer subgraph search and introduce optimizations to greatly reduc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.09240","kind":"arxiv","version":3},"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-18T00:06:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c4xJx0+spRLSFxPO4+EiYxX3Q5hHr0hY3wK5Iy6LOZ9EeM/kWG7HCi39owgL76y5VweZjPyGNc3PV3WzYqTQDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T17:45:19.076384Z"},"content_sha256":"75406c9e5cd191cfc11d9b811fb0db4bf11b1066ea260e887a76a5d848218d19","schema_version":"1.0","event_id":"sha256:75406c9e5cd191cfc11d9b811fb0db4bf11b1066ea260e887a76a5d848218d19"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3J6EMRFK36RJYQIET2HISCKPLB/bundle.json","state_url":"https://pith.science/pith/3J6EMRFK36RJYQIET2HISCKPLB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3J6EMRFK36RJYQIET2HISCKPLB/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-07-02T17:45:19Z","links":{"resolver":"https://pith.science/pith/3J6EMRFK36RJYQIET2HISCKPLB","bundle":"https://pith.science/pith/3J6EMRFK36RJYQIET2HISCKPLB/bundle.json","state":"https://pith.science/pith/3J6EMRFK36RJYQIET2HISCKPLB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3J6EMRFK36RJYQIET2HISCKPLB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:3J6EMRFK36RJYQIET2HISCKPLB","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":"53ea0291b7c51ee5b956a9760d958c60b944a19cdb9f9796353b7819409ea0be","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2018-01-28T14:43:04Z","title_canon_sha256":"c8ba7a17d647acade5144eb9530746e3ef2a51051875c552c5131b4b75978270"},"schema_version":"1.0","source":{"id":"1801.09240","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.09240","created_at":"2026-05-18T00:06:40Z"},{"alias_kind":"arxiv_version","alias_value":"1801.09240v3","created_at":"2026-05-18T00:06:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.09240","created_at":"2026-05-18T00:06:40Z"},{"alias_kind":"pith_short_12","alias_value":"3J6EMRFK36RJ","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"3J6EMRFK36RJYQIE","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"3J6EMRFK","created_at":"2026-05-18T12:32:02Z"}],"graph_snapshots":[{"event_id":"sha256:75406c9e5cd191cfc11d9b811fb0db4bf11b1066ea260e887a76a5d848218d19","target":"graph","created_at":"2026-05-18T00:06:40Z","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":"The growing popularity of dynamic applications such as social networks provides a promising way to detect valuable information in real time. Efficient analysis over high-speed data from dynamic applications is of great significance. Data from these dynamic applications can be easily modeled as streaming graph. In this paper, we study the subgraph (isomorphism) search over streaming graph data that obeys timing order constraints over the occurrence of edges in the stream. We propose a data structure and algorithm to efficiently answer subgraph search and introduce optimizations to greatly reduc","authors_text":"Dongyan Zhao, Lei Zou, M. Tamer Ozsu, Youhuan Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2018-01-28T14:43:04Z","title":"Time Constrained Continuous Subgraph Search over Streaming Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.09240","kind":"arxiv","version":3},"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:8ac4abe5d114a3d13143dee6e025b7e3da39be6a78ab41c8b4827daa5af3d693","target":"record","created_at":"2026-05-18T00:06:40Z","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":"53ea0291b7c51ee5b956a9760d958c60b944a19cdb9f9796353b7819409ea0be","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2018-01-28T14:43:04Z","title_canon_sha256":"c8ba7a17d647acade5144eb9530746e3ef2a51051875c552c5131b4b75978270"},"schema_version":"1.0","source":{"id":"1801.09240","kind":"arxiv","version":3}},"canonical_sha256":"da7c4644aadfa29c41049e8e89094f58644df6c2df0ddebefec6bdc1b9008f5a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"da7c4644aadfa29c41049e8e89094f58644df6c2df0ddebefec6bdc1b9008f5a","first_computed_at":"2026-05-18T00:06:40.756466Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:06:40.756466Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EbaeTx2TN6uirww/Xgq2dNcweTtkLoWoIxvLalMrgXMsTkOKbFrd+TK3OGVQc2ZXVzDueGjD0yTHMEKZ5YUfBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:06:40.756935Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.09240","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8ac4abe5d114a3d13143dee6e025b7e3da39be6a78ab41c8b4827daa5af3d693","sha256:75406c9e5cd191cfc11d9b811fb0db4bf11b1066ea260e887a76a5d848218d19"],"state_sha256":"13516e4921331a0e4e6c71d571c70d4e2d8bd4c3b3c12497e3dcf6c9b966c8ed"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3yQW2ekSYrlgFsIwMKwSzmnGIFdnmI35GmZUEZltHvKcz5dpG5m7AGEasyWXED5adLRuHstJZkwLF+ob+zWWBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-02T17:45:19.078579Z","bundle_sha256":"e3ee1db0c83b1a2ffbea3fd68645032aff17aa9f6332a3febd4f7f95241659de"}}