{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:S2KO2BKE2Y7KW3GXFGUJ6PJKC3","short_pith_number":"pith:S2KO2BKE","canonical_record":{"source":{"id":"2001.01661","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-01-06T16:52:44Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"958042b504fdf17a0a519d48143f459384e6ec0eac271327c354ad3a576a710d","abstract_canon_sha256":"d2d8bfe3b9be954a838bd500b2e6c11db7f8dbe728f6759f72753dfb56e0eb18"},"schema_version":"1.0"},"canonical_sha256":"9694ed0544d63eab6cd729a89f3d2a16cbd2b157dac0b2248659088f481ad569","source":{"kind":"arxiv","id":"2001.01661","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2001.01661","created_at":"2026-07-05T00:35:34Z"},{"alias_kind":"arxiv_version","alias_value":"2001.01661v2","created_at":"2026-07-05T00:35:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2001.01661","created_at":"2026-07-05T00:35:34Z"},{"alias_kind":"pith_short_12","alias_value":"S2KO2BKE2Y7K","created_at":"2026-07-05T00:35:34Z"},{"alias_kind":"pith_short_16","alias_value":"S2KO2BKE2Y7KW3GX","created_at":"2026-07-05T00:35:34Z"},{"alias_kind":"pith_short_8","alias_value":"S2KO2BKE","created_at":"2026-07-05T00:35:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:S2KO2BKE2Y7KW3GXFGUJ6PJKC3","target":"record","payload":{"canonical_record":{"source":{"id":"2001.01661","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-01-06T16:52:44Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"958042b504fdf17a0a519d48143f459384e6ec0eac271327c354ad3a576a710d","abstract_canon_sha256":"d2d8bfe3b9be954a838bd500b2e6c11db7f8dbe728f6759f72753dfb56e0eb18"},"schema_version":"1.0"},"canonical_sha256":"9694ed0544d63eab6cd729a89f3d2a16cbd2b157dac0b2248659088f481ad569","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:35:34.732212Z","signature_b64":"UHfyWnDTHj3JkeV/7RtyhMP6bXQzEWyy1QZmvdqw5zLU52U4X/U7O8LjRkX9pe5Zjt3IQvaX/bbdNJDArAIKCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9694ed0544d63eab6cd729a89f3d2a16cbd2b157dac0b2248659088f481ad569","last_reissued_at":"2026-07-05T00:35:34.731801Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:35:34.731801Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2001.01661","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-07-05T00:35:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OZ3eG0vhq9msaKx1+cQCoDkNFEYXGioYwhb9WOQe3sg6WCgSGvse40AalqmWhiPx9YwEoWfm6h8dEbG3OOrjCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T01:36:27.337143Z"},"content_sha256":"22a13420bd521ac876a9addcee774a0ed814bac360f5398f2a1f30f57e3baa63","schema_version":"1.0","event_id":"sha256:22a13420bd521ac876a9addcee774a0ed814bac360f5398f2a1f30f57e3baa63"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:S2KO2BKE2Y7KW3GXFGUJ6PJKC3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Hybrid Approach to Temporal Pattern Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.DS","authors_text":"Evaggelia Pitoura, Konstantinos Semertzidis","submitted_at":"2020-01-06T16:52:44Z","abstract_excerpt":"The primary objective of graph pattern matching is to find all appearances of an input graph pattern query in a large data graph. Such appearances are called matches. In this paper, we are interested in finding matches of interaction patterns in temporal graphs. To this end, we propose a hybrid approach that achieves effective filtering of potential matches based both on structure and time. Our approach exploits a graph representation where edges are ordered by time. We present experiments with real datasets that illustrate the efficiency of our approach."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2001.01661","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2001.01661/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T00:35:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F4LuyyuoFIh45SRdcXzZASR7liPwhwfaIGD3jTifuGQ2vU45MdWigTriPQXNLFiiZsb2TSGV3Wzj7rEGWGMEBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T01:36:27.337712Z"},"content_sha256":"62fa3a86b301abd380ae01c7ff4f7284d42e9ab58269288e3b9215cbd580ccd3","schema_version":"1.0","event_id":"sha256:62fa3a86b301abd380ae01c7ff4f7284d42e9ab58269288e3b9215cbd580ccd3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S2KO2BKE2Y7KW3GXFGUJ6PJKC3/bundle.json","state_url":"https://pith.science/pith/S2KO2BKE2Y7KW3GXFGUJ6PJKC3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S2KO2BKE2Y7KW3GXFGUJ6PJKC3/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-18T01:36:27Z","links":{"resolver":"https://pith.science/pith/S2KO2BKE2Y7KW3GXFGUJ6PJKC3","bundle":"https://pith.science/pith/S2KO2BKE2Y7KW3GXFGUJ6PJKC3/bundle.json","state":"https://pith.science/pith/S2KO2BKE2Y7KW3GXFGUJ6PJKC3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S2KO2BKE2Y7KW3GXFGUJ6PJKC3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:S2KO2BKE2Y7KW3GXFGUJ6PJKC3","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":"d2d8bfe3b9be954a838bd500b2e6c11db7f8dbe728f6759f72753dfb56e0eb18","cross_cats_sorted":["cs.CV"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-01-06T16:52:44Z","title_canon_sha256":"958042b504fdf17a0a519d48143f459384e6ec0eac271327c354ad3a576a710d"},"schema_version":"1.0","source":{"id":"2001.01661","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2001.01661","created_at":"2026-07-05T00:35:34Z"},{"alias_kind":"arxiv_version","alias_value":"2001.01661v2","created_at":"2026-07-05T00:35:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2001.01661","created_at":"2026-07-05T00:35:34Z"},{"alias_kind":"pith_short_12","alias_value":"S2KO2BKE2Y7K","created_at":"2026-07-05T00:35:34Z"},{"alias_kind":"pith_short_16","alias_value":"S2KO2BKE2Y7KW3GX","created_at":"2026-07-05T00:35:34Z"},{"alias_kind":"pith_short_8","alias_value":"S2KO2BKE","created_at":"2026-07-05T00:35:34Z"}],"graph_snapshots":[{"event_id":"sha256:62fa3a86b301abd380ae01c7ff4f7284d42e9ab58269288e3b9215cbd580ccd3","target":"graph","created_at":"2026-07-05T00:35:34Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2001.01661/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The primary objective of graph pattern matching is to find all appearances of an input graph pattern query in a large data graph. Such appearances are called matches. In this paper, we are interested in finding matches of interaction patterns in temporal graphs. To this end, we propose a hybrid approach that achieves effective filtering of potential matches based both on structure and time. Our approach exploits a graph representation where edges are ordered by time. We present experiments with real datasets that illustrate the efficiency of our approach.","authors_text":"Evaggelia Pitoura, Konstantinos Semertzidis","cross_cats":["cs.CV"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-01-06T16:52:44Z","title":"A Hybrid Approach to Temporal Pattern Matching"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2001.01661","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:22a13420bd521ac876a9addcee774a0ed814bac360f5398f2a1f30f57e3baa63","target":"record","created_at":"2026-07-05T00:35:34Z","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":"d2d8bfe3b9be954a838bd500b2e6c11db7f8dbe728f6759f72753dfb56e0eb18","cross_cats_sorted":["cs.CV"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-01-06T16:52:44Z","title_canon_sha256":"958042b504fdf17a0a519d48143f459384e6ec0eac271327c354ad3a576a710d"},"schema_version":"1.0","source":{"id":"2001.01661","kind":"arxiv","version":2}},"canonical_sha256":"9694ed0544d63eab6cd729a89f3d2a16cbd2b157dac0b2248659088f481ad569","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9694ed0544d63eab6cd729a89f3d2a16cbd2b157dac0b2248659088f481ad569","first_computed_at":"2026-07-05T00:35:34.731801Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:35:34.731801Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UHfyWnDTHj3JkeV/7RtyhMP6bXQzEWyy1QZmvdqw5zLU52U4X/U7O8LjRkX9pe5Zjt3IQvaX/bbdNJDArAIKCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T00:35:34.732212Z","signed_message":"canonical_sha256_bytes"},"source_id":"2001.01661","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:22a13420bd521ac876a9addcee774a0ed814bac360f5398f2a1f30f57e3baa63","sha256:62fa3a86b301abd380ae01c7ff4f7284d42e9ab58269288e3b9215cbd580ccd3"],"state_sha256":"5e3c8479a789d624a176e2efc390abde40f9ec1cccd8229c78621c7a82660d33"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mRGhPRrwntnRm4Bb/19rYycTIapzgbz/GoNXYNkNkDYfY7+3EygRPJz1wC4nRa3AvPZ8X1wOO+hkrR8KJK1LDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-18T01:36:27.343440Z","bundle_sha256":"877c359d4ad6f9e7d0da25cebb031029943878fb77e848338dd9c8aeacdaf746"}}