{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:AIFAXJP5RLQMW7RHCZMTSMFMC7","short_pith_number":"pith:AIFAXJP5","canonical_record":{"source":{"id":"1805.03320","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2018-05-08T23:52:34Z","cross_cats_sorted":[],"title_canon_sha256":"e67301f74baa9d8987bb61db153e6692391c810861c1952352eba91e7184706e","abstract_canon_sha256":"c326eb4ef58032e1efb1aa8e0c3182e09e9e9127e5394fb625f457a7fb772a03"},"schema_version":"1.0"},"canonical_sha256":"020a0ba5fd8ae0cb7e2716593930ac17cd9d9dc6e520e99c0329c027ec1ce4bd","source":{"kind":"arxiv","id":"1805.03320","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.03320","created_at":"2026-05-18T00:16:20Z"},{"alias_kind":"arxiv_version","alias_value":"1805.03320v1","created_at":"2026-05-18T00:16:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.03320","created_at":"2026-05-18T00:16:20Z"},{"alias_kind":"pith_short_12","alias_value":"AIFAXJP5RLQM","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"AIFAXJP5RLQMW7RH","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"AIFAXJP5","created_at":"2026-05-18T12:32:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:AIFAXJP5RLQMW7RHCZMTSMFMC7","target":"record","payload":{"canonical_record":{"source":{"id":"1805.03320","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2018-05-08T23:52:34Z","cross_cats_sorted":[],"title_canon_sha256":"e67301f74baa9d8987bb61db153e6692391c810861c1952352eba91e7184706e","abstract_canon_sha256":"c326eb4ef58032e1efb1aa8e0c3182e09e9e9127e5394fb625f457a7fb772a03"},"schema_version":"1.0"},"canonical_sha256":"020a0ba5fd8ae0cb7e2716593930ac17cd9d9dc6e520e99c0329c027ec1ce4bd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:20.509607Z","signature_b64":"FtMisE1zDyfgMh5Kl46BMR8ecfFWRKvg89zaAdGC6fCvq9sMUKJRaAYjI6GG0h/oJIyYJ7EOp9qutujkZkiFAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"020a0ba5fd8ae0cb7e2716593930ac17cd9d9dc6e520e99c0329c027ec1ce4bd","last_reissued_at":"2026-05-18T00:16:20.508975Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:20.508975Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.03320","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-18T00:16:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6tj6c7p6vrN7+XK/5NO1ydrqPJBtRQld2EQFsXjLibsJ1D35662TW/u22c35lqMmPjAj6HNp3zXVGM+RaFEpCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T10:45:15.148680Z"},"content_sha256":"f2e0838a82e5a66d6b393d7863d18274c7ebd63fec0ff2483906bef60c94c09d","schema_version":"1.0","event_id":"sha256:f2e0838a82e5a66d6b393d7863d18274c7ebd63fec0ff2483906bef60c94c09d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:AIFAXJP5RLQMW7RHCZMTSMFMC7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Mining Top-k Sequential Patterns in Database Graphs:A New Challenging Problem and a Sampling-based Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Lingyang Chu, Mingtao Lei, Zhefeng Wang","submitted_at":"2018-05-08T23:52:34Z","abstract_excerpt":"In many real world networks, a vertex is usually associated with a transaction database that comprehensively describes the behaviour of the vertex. A typical example is the social network, where the behaviour of every user is depicted by a transaction database that stores his daily posted contents. A transaction database is a set of transactions, where a transaction is a set of items. Every path of the network is a sequence of vertices that induces multiple sequences of transactions. The sequences of transactions induced by all of the paths in the network forms an extremely large sequence data"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.03320","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-18T00:16:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oHchDaOREOu4L7+7PgHXmhtW6/t7Z+kq4GwXjNpem1Sqo7VcF8+4tyeYM5rFRnS6Y0aGGGO+blA7dtGENT7WCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T10:45:15.149026Z"},"content_sha256":"920bf82979879edb45d57da39659323d3b2dc2fb4a7a465a06b3a59688ff04c4","schema_version":"1.0","event_id":"sha256:920bf82979879edb45d57da39659323d3b2dc2fb4a7a465a06b3a59688ff04c4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AIFAXJP5RLQMW7RHCZMTSMFMC7/bundle.json","state_url":"https://pith.science/pith/AIFAXJP5RLQMW7RHCZMTSMFMC7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AIFAXJP5RLQMW7RHCZMTSMFMC7/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-28T10:45:15Z","links":{"resolver":"https://pith.science/pith/AIFAXJP5RLQMW7RHCZMTSMFMC7","bundle":"https://pith.science/pith/AIFAXJP5RLQMW7RHCZMTSMFMC7/bundle.json","state":"https://pith.science/pith/AIFAXJP5RLQMW7RHCZMTSMFMC7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AIFAXJP5RLQMW7RHCZMTSMFMC7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:AIFAXJP5RLQMW7RHCZMTSMFMC7","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":"c326eb4ef58032e1efb1aa8e0c3182e09e9e9127e5394fb625f457a7fb772a03","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2018-05-08T23:52:34Z","title_canon_sha256":"e67301f74baa9d8987bb61db153e6692391c810861c1952352eba91e7184706e"},"schema_version":"1.0","source":{"id":"1805.03320","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.03320","created_at":"2026-05-18T00:16:20Z"},{"alias_kind":"arxiv_version","alias_value":"1805.03320v1","created_at":"2026-05-18T00:16:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.03320","created_at":"2026-05-18T00:16:20Z"},{"alias_kind":"pith_short_12","alias_value":"AIFAXJP5RLQM","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"AIFAXJP5RLQMW7RH","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"AIFAXJP5","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:920bf82979879edb45d57da39659323d3b2dc2fb4a7a465a06b3a59688ff04c4","target":"graph","created_at":"2026-05-18T00:16:20Z","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":"In many real world networks, a vertex is usually associated with a transaction database that comprehensively describes the behaviour of the vertex. A typical example is the social network, where the behaviour of every user is depicted by a transaction database that stores his daily posted contents. A transaction database is a set of transactions, where a transaction is a set of items. Every path of the network is a sequence of vertices that induces multiple sequences of transactions. The sequences of transactions induced by all of the paths in the network forms an extremely large sequence data","authors_text":"Lingyang Chu, Mingtao Lei, Zhefeng Wang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2018-05-08T23:52:34Z","title":"Mining Top-k Sequential Patterns in Database Graphs:A New Challenging Problem and a Sampling-based Approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.03320","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:f2e0838a82e5a66d6b393d7863d18274c7ebd63fec0ff2483906bef60c94c09d","target":"record","created_at":"2026-05-18T00:16:20Z","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":"c326eb4ef58032e1efb1aa8e0c3182e09e9e9127e5394fb625f457a7fb772a03","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2018-05-08T23:52:34Z","title_canon_sha256":"e67301f74baa9d8987bb61db153e6692391c810861c1952352eba91e7184706e"},"schema_version":"1.0","source":{"id":"1805.03320","kind":"arxiv","version":1}},"canonical_sha256":"020a0ba5fd8ae0cb7e2716593930ac17cd9d9dc6e520e99c0329c027ec1ce4bd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"020a0ba5fd8ae0cb7e2716593930ac17cd9d9dc6e520e99c0329c027ec1ce4bd","first_computed_at":"2026-05-18T00:16:20.508975Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:16:20.508975Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FtMisE1zDyfgMh5Kl46BMR8ecfFWRKvg89zaAdGC6fCvq9sMUKJRaAYjI6GG0h/oJIyYJ7EOp9qutujkZkiFAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:16:20.509607Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.03320","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f2e0838a82e5a66d6b393d7863d18274c7ebd63fec0ff2483906bef60c94c09d","sha256:920bf82979879edb45d57da39659323d3b2dc2fb4a7a465a06b3a59688ff04c4"],"state_sha256":"328b44baff72f45ce149c775cfa941dbec288b84dcf804d252aa8d60f7e9d1f5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WgWqObwU/IJcO/BUEwUxd0zthhr3QjE/3ZIneAxCirAfc7LErdfXKjzPATnFJw8NFxPLlnmkRhjQ2/TpgniBBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T10:45:15.150957Z","bundle_sha256":"d3e5e3ad6713fd83d14726e7d71ae5f4a91ecef191432549935fff147de194b5"}}