{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:AIFAXJP5RLQMW7RHCZMTSMFMC7","short_pith_number":"pith:AIFAXJP5","schema_version":"1.0","canonical_sha256":"020a0ba5fd8ae0cb7e2716593930ac17cd9d9dc6e520e99c0329c027ec1ce4bd","source":{"kind":"arxiv","id":"1805.03320","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1805.03320","created_at":"2026-05-18T00:16:20.509054+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.03320v1","created_at":"2026-05-18T00:16:20.509054+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.03320","created_at":"2026-05-18T00:16:20.509054+00:00"},{"alias_kind":"pith_short_12","alias_value":"AIFAXJP5RLQM","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_16","alias_value":"AIFAXJP5RLQMW7RH","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_8","alias_value":"AIFAXJP5","created_at":"2026-05-18T12:32:13.499390+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AIFAXJP5RLQMW7RHCZMTSMFMC7","json":"https://pith.science/pith/AIFAXJP5RLQMW7RHCZMTSMFMC7.json","graph_json":"https://pith.science/api/pith-number/AIFAXJP5RLQMW7RHCZMTSMFMC7/graph.json","events_json":"https://pith.science/api/pith-number/AIFAXJP5RLQMW7RHCZMTSMFMC7/events.json","paper":"https://pith.science/paper/AIFAXJP5"},"agent_actions":{"view_html":"https://pith.science/pith/AIFAXJP5RLQMW7RHCZMTSMFMC7","download_json":"https://pith.science/pith/AIFAXJP5RLQMW7RHCZMTSMFMC7.json","view_paper":"https://pith.science/paper/AIFAXJP5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.03320&json=true","fetch_graph":"https://pith.science/api/pith-number/AIFAXJP5RLQMW7RHCZMTSMFMC7/graph.json","fetch_events":"https://pith.science/api/pith-number/AIFAXJP5RLQMW7RHCZMTSMFMC7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AIFAXJP5RLQMW7RHCZMTSMFMC7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AIFAXJP5RLQMW7RHCZMTSMFMC7/action/storage_attestation","attest_author":"https://pith.science/pith/AIFAXJP5RLQMW7RHCZMTSMFMC7/action/author_attestation","sign_citation":"https://pith.science/pith/AIFAXJP5RLQMW7RHCZMTSMFMC7/action/citation_signature","submit_replication":"https://pith.science/pith/AIFAXJP5RLQMW7RHCZMTSMFMC7/action/replication_record"}},"created_at":"2026-05-18T00:16:20.509054+00:00","updated_at":"2026-05-18T00:16:20.509054+00:00"}