{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:7DLFC5L3ABH7LTAGMAU3YO62XO","short_pith_number":"pith:7DLFC5L3","canonical_record":{"source":{"id":"1812.10321","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2018-12-21T05:34:26Z","cross_cats_sorted":[],"title_canon_sha256":"7976bda5de090d6bcf1a869391c88e5e9ad3cdb7fd7893897f13081abdf13ae1","abstract_canon_sha256":"e243bed65a5815ffa2a53090427dd13bb476089edc5506e4481356b9163288cb"},"schema_version":"1.0"},"canonical_sha256":"f8d651757b004ff5cc066029bc3bdabbaf6c4a8ad4ddfe89dc89222f22642edd","source":{"kind":"arxiv","id":"1812.10321","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.10321","created_at":"2026-05-17T23:41:12Z"},{"alias_kind":"arxiv_version","alias_value":"1812.10321v1","created_at":"2026-05-17T23:41:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.10321","created_at":"2026-05-17T23:41:12Z"},{"alias_kind":"pith_short_12","alias_value":"7DLFC5L3ABH7","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"7DLFC5L3ABH7LTAG","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"7DLFC5L3","created_at":"2026-05-18T12:32:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:7DLFC5L3ABH7LTAGMAU3YO62XO","target":"record","payload":{"canonical_record":{"source":{"id":"1812.10321","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2018-12-21T05:34:26Z","cross_cats_sorted":[],"title_canon_sha256":"7976bda5de090d6bcf1a869391c88e5e9ad3cdb7fd7893897f13081abdf13ae1","abstract_canon_sha256":"e243bed65a5815ffa2a53090427dd13bb476089edc5506e4481356b9163288cb"},"schema_version":"1.0"},"canonical_sha256":"f8d651757b004ff5cc066029bc3bdabbaf6c4a8ad4ddfe89dc89222f22642edd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:12.392025Z","signature_b64":"CYDggHWuxx13xRQ+r/yEOMxFyTeu8NdGR0QxM+kQvEiiccolTeI1xqFPyHfuqdz1WXo0z1lJp/IpuSSMoR2bBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f8d651757b004ff5cc066029bc3bdabbaf6c4a8ad4ddfe89dc89222f22642edd","last_reissued_at":"2026-05-17T23:41:12.391570Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:12.391570Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1812.10321","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-17T23:41:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3g6GlPn1hYCNAcg/pt3YXev6393OP/hHygvapnTNWA1EOvwAtsJrqLkASaKBpYhSvMN04H04JMXsKv76tJKKDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T22:41:53.365140Z"},"content_sha256":"1cc25de5267f5b3e847db14dabec28215f086e45dfd90a6a476ba4cc4d2acd7b","schema_version":"1.0","event_id":"sha256:1cc25de5267f5b3e847db14dabec28215f086e45dfd90a6a476ba4cc4d2acd7b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:7DLFC5L3ABH7LTAGMAU3YO62XO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Adaptive Pattern Matching with Reinforcement Learning for Dynamic Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Dario Garcia-Gasulla, Hiroki Kanezashi, Min-hwan Oh, Satoshi Matsuoka, Toyotaro Suzumura","submitted_at":"2018-12-21T05:34:26Z","abstract_excerpt":"Graph pattern matching algorithms to handle million-scale dynamic graphs are widely used in many applications such as social network analytics and suspicious transaction detections from financial networks. On the other hand, the computation complexity of many graph pattern matching algorithms is expensive, and it is not affordable to extract patterns from million-scale graphs. Moreover, most real-world networks are time-evolving, updating their structures continuously, which makes it harder to update and output newly matched patterns in real time. Many incremental graph pattern matching algori"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.10321","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-17T23:41:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qmZ9OEcJVDkxwaEc/AkSMFf7Gl+KQmKyoTbI3cf83ASeZm5qeaC5uuZ/fW3xk3/dLCf7k5mt8/Z2wt5M7z08AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T22:41:53.365493Z"},"content_sha256":"f232353296935b0a10a77ef2a9fca829b8cd3cdf5640d09de287ba8442212409","schema_version":"1.0","event_id":"sha256:f232353296935b0a10a77ef2a9fca829b8cd3cdf5640d09de287ba8442212409"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7DLFC5L3ABH7LTAGMAU3YO62XO/bundle.json","state_url":"https://pith.science/pith/7DLFC5L3ABH7LTAGMAU3YO62XO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7DLFC5L3ABH7LTAGMAU3YO62XO/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-06-01T22:41:53Z","links":{"resolver":"https://pith.science/pith/7DLFC5L3ABH7LTAGMAU3YO62XO","bundle":"https://pith.science/pith/7DLFC5L3ABH7LTAGMAU3YO62XO/bundle.json","state":"https://pith.science/pith/7DLFC5L3ABH7LTAGMAU3YO62XO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7DLFC5L3ABH7LTAGMAU3YO62XO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:7DLFC5L3ABH7LTAGMAU3YO62XO","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":"e243bed65a5815ffa2a53090427dd13bb476089edc5506e4481356b9163288cb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2018-12-21T05:34:26Z","title_canon_sha256":"7976bda5de090d6bcf1a869391c88e5e9ad3cdb7fd7893897f13081abdf13ae1"},"schema_version":"1.0","source":{"id":"1812.10321","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.10321","created_at":"2026-05-17T23:41:12Z"},{"alias_kind":"arxiv_version","alias_value":"1812.10321v1","created_at":"2026-05-17T23:41:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.10321","created_at":"2026-05-17T23:41:12Z"},{"alias_kind":"pith_short_12","alias_value":"7DLFC5L3ABH7","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"7DLFC5L3ABH7LTAG","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"7DLFC5L3","created_at":"2026-05-18T12:32:11Z"}],"graph_snapshots":[{"event_id":"sha256:f232353296935b0a10a77ef2a9fca829b8cd3cdf5640d09de287ba8442212409","target":"graph","created_at":"2026-05-17T23:41:12Z","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":"Graph pattern matching algorithms to handle million-scale dynamic graphs are widely used in many applications such as social network analytics and suspicious transaction detections from financial networks. On the other hand, the computation complexity of many graph pattern matching algorithms is expensive, and it is not affordable to extract patterns from million-scale graphs. Moreover, most real-world networks are time-evolving, updating their structures continuously, which makes it harder to update and output newly matched patterns in real time. Many incremental graph pattern matching algori","authors_text":"Dario Garcia-Gasulla, Hiroki Kanezashi, Min-hwan Oh, Satoshi Matsuoka, Toyotaro Suzumura","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2018-12-21T05:34:26Z","title":"Adaptive Pattern Matching with Reinforcement Learning for Dynamic Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.10321","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:1cc25de5267f5b3e847db14dabec28215f086e45dfd90a6a476ba4cc4d2acd7b","target":"record","created_at":"2026-05-17T23:41:12Z","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":"e243bed65a5815ffa2a53090427dd13bb476089edc5506e4481356b9163288cb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2018-12-21T05:34:26Z","title_canon_sha256":"7976bda5de090d6bcf1a869391c88e5e9ad3cdb7fd7893897f13081abdf13ae1"},"schema_version":"1.0","source":{"id":"1812.10321","kind":"arxiv","version":1}},"canonical_sha256":"f8d651757b004ff5cc066029bc3bdabbaf6c4a8ad4ddfe89dc89222f22642edd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f8d651757b004ff5cc066029bc3bdabbaf6c4a8ad4ddfe89dc89222f22642edd","first_computed_at":"2026-05-17T23:41:12.391570Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:41:12.391570Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CYDggHWuxx13xRQ+r/yEOMxFyTeu8NdGR0QxM+kQvEiiccolTeI1xqFPyHfuqdz1WXo0z1lJp/IpuSSMoR2bBw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:41:12.392025Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.10321","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1cc25de5267f5b3e847db14dabec28215f086e45dfd90a6a476ba4cc4d2acd7b","sha256:f232353296935b0a10a77ef2a9fca829b8cd3cdf5640d09de287ba8442212409"],"state_sha256":"1b44b3d5fbd494658e714c75eb2204fc7a98347a4d67e5e6d2b5df892f629cc7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G7yd03q2WK6SyjSDh6ANCRZQAY1Z684EdRUf3e0TzxyrcJfqUQgJX9FKPYZ70vK3FPzI2gF2/1kcfeIT2/riBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T22:41:53.367377Z","bundle_sha256":"33aaa3318017c7fd03a6d40b9880f71f3367291b67716e724c2044e8bea677a6"}}