{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:PZQXM5SGN6ECR4BHTVLMPZGWEZ","short_pith_number":"pith:PZQXM5SG","canonical_record":{"source":{"id":"1312.4477","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.DB","submitted_at":"2013-12-13T15:00:50Z","cross_cats_sorted":[],"title_canon_sha256":"978480e69a51a50a7477bb864372a2fb177291671edd515432f015a7aec1eeec","abstract_canon_sha256":"48431af5d8832fe9449f33415452f6b40ab0f61d25318d19c2a42e86a010d42b"},"schema_version":"1.0"},"canonical_sha256":"7e617676466f8828f0279d56c7e4d62657a6016dae6232936a5f06182bf38ad5","source":{"kind":"arxiv","id":"1312.4477","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.4477","created_at":"2026-05-18T03:04:24Z"},{"alias_kind":"arxiv_version","alias_value":"1312.4477v1","created_at":"2026-05-18T03:04:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.4477","created_at":"2026-05-18T03:04:24Z"},{"alias_kind":"pith_short_12","alias_value":"PZQXM5SGN6EC","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"PZQXM5SGN6ECR4BH","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"PZQXM5SG","created_at":"2026-05-18T12:27:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:PZQXM5SGN6ECR4BHTVLMPZGWEZ","target":"record","payload":{"canonical_record":{"source":{"id":"1312.4477","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.DB","submitted_at":"2013-12-13T15:00:50Z","cross_cats_sorted":[],"title_canon_sha256":"978480e69a51a50a7477bb864372a2fb177291671edd515432f015a7aec1eeec","abstract_canon_sha256":"48431af5d8832fe9449f33415452f6b40ab0f61d25318d19c2a42e86a010d42b"},"schema_version":"1.0"},"canonical_sha256":"7e617676466f8828f0279d56c7e4d62657a6016dae6232936a5f06182bf38ad5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:04:24.648761Z","signature_b64":"OZCMP3Nyqx59osObT0SwHdvC6SD6KPBKwXWd/YWtIRVvgI8sMhwhcf9pRrIidX/C1OFpLWZFvSTxoYN+5QZ5AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7e617676466f8828f0279d56c7e4d62657a6016dae6232936a5f06182bf38ad5","last_reissued_at":"2026-05-18T03:04:24.648310Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:04:24.648310Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1312.4477","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-18T03:04:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9+74SZ0kTmZgT9gWf8RDnQsBBQj76PoW6LPqOHjy2DSXS/+UaN6ABuY7Oiq4O6a0tGf8Dv1UeQEKblKTV+GVBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T04:23:30.427132Z"},"content_sha256":"dc7ac9061fdb40fe1f66fc31311eff0706dc127562775d3cba86d47c67bfc288","schema_version":"1.0","event_id":"sha256:dc7ac9061fdb40fe1f66fc31311eff0706dc127562775d3cba86d47c67bfc288"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:PZQXM5SGN6ECR4BHTVLMPZGWEZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"GCG: Mining Maximal Complete Graph Patterns from Large Spatial Data","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Ghazi Al-Naymat","submitted_at":"2013-12-13T15:00:50Z","abstract_excerpt":"Recent research on pattern discovery has progressed from mining frequent patterns and sequences to mining structured patterns, such as trees and graphs. Graphs as general data structure can model complex relations among data with wide applications in web exploration and social networks. However, the process of mining large graph patterns is a challenge due to the existence of large number of subgraphs. In this paper, we aim to mine only frequent complete graph patterns. A graph g in a database is complete if every pair of distinct vertices is connected by a unique edge. Grid Complete Graph (GC"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.4477","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-18T03:04:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LpyvicbrlZWe1E1n/XHyEwZz//3zTuyLxFyxQDVuUZA74X8222HP3bv2O2hxBLMDVMEsKrPhb88DROuE/gtIDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T04:23:30.427785Z"},"content_sha256":"5eeb102323cc58f4d4faf7c2a4daeffb8e3ef01a058d4efcf5d264e299c24239","schema_version":"1.0","event_id":"sha256:5eeb102323cc58f4d4faf7c2a4daeffb8e3ef01a058d4efcf5d264e299c24239"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PZQXM5SGN6ECR4BHTVLMPZGWEZ/bundle.json","state_url":"https://pith.science/pith/PZQXM5SGN6ECR4BHTVLMPZGWEZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PZQXM5SGN6ECR4BHTVLMPZGWEZ/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-07T04:23:30Z","links":{"resolver":"https://pith.science/pith/PZQXM5SGN6ECR4BHTVLMPZGWEZ","bundle":"https://pith.science/pith/PZQXM5SGN6ECR4BHTVLMPZGWEZ/bundle.json","state":"https://pith.science/pith/PZQXM5SGN6ECR4BHTVLMPZGWEZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PZQXM5SGN6ECR4BHTVLMPZGWEZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:PZQXM5SGN6ECR4BHTVLMPZGWEZ","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":"48431af5d8832fe9449f33415452f6b40ab0f61d25318d19c2a42e86a010d42b","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.DB","submitted_at":"2013-12-13T15:00:50Z","title_canon_sha256":"978480e69a51a50a7477bb864372a2fb177291671edd515432f015a7aec1eeec"},"schema_version":"1.0","source":{"id":"1312.4477","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.4477","created_at":"2026-05-18T03:04:24Z"},{"alias_kind":"arxiv_version","alias_value":"1312.4477v1","created_at":"2026-05-18T03:04:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.4477","created_at":"2026-05-18T03:04:24Z"},{"alias_kind":"pith_short_12","alias_value":"PZQXM5SGN6EC","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"PZQXM5SGN6ECR4BH","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"PZQXM5SG","created_at":"2026-05-18T12:27:57Z"}],"graph_snapshots":[{"event_id":"sha256:5eeb102323cc58f4d4faf7c2a4daeffb8e3ef01a058d4efcf5d264e299c24239","target":"graph","created_at":"2026-05-18T03:04:24Z","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":"Recent research on pattern discovery has progressed from mining frequent patterns and sequences to mining structured patterns, such as trees and graphs. Graphs as general data structure can model complex relations among data with wide applications in web exploration and social networks. However, the process of mining large graph patterns is a challenge due to the existence of large number of subgraphs. In this paper, we aim to mine only frequent complete graph patterns. A graph g in a database is complete if every pair of distinct vertices is connected by a unique edge. Grid Complete Graph (GC","authors_text":"Ghazi Al-Naymat","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.DB","submitted_at":"2013-12-13T15:00:50Z","title":"GCG: Mining Maximal Complete Graph Patterns from Large Spatial Data"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.4477","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:dc7ac9061fdb40fe1f66fc31311eff0706dc127562775d3cba86d47c67bfc288","target":"record","created_at":"2026-05-18T03:04:24Z","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":"48431af5d8832fe9449f33415452f6b40ab0f61d25318d19c2a42e86a010d42b","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.DB","submitted_at":"2013-12-13T15:00:50Z","title_canon_sha256":"978480e69a51a50a7477bb864372a2fb177291671edd515432f015a7aec1eeec"},"schema_version":"1.0","source":{"id":"1312.4477","kind":"arxiv","version":1}},"canonical_sha256":"7e617676466f8828f0279d56c7e4d62657a6016dae6232936a5f06182bf38ad5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7e617676466f8828f0279d56c7e4d62657a6016dae6232936a5f06182bf38ad5","first_computed_at":"2026-05-18T03:04:24.648310Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:04:24.648310Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OZCMP3Nyqx59osObT0SwHdvC6SD6KPBKwXWd/YWtIRVvgI8sMhwhcf9pRrIidX/C1OFpLWZFvSTxoYN+5QZ5AA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:04:24.648761Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.4477","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dc7ac9061fdb40fe1f66fc31311eff0706dc127562775d3cba86d47c67bfc288","sha256:5eeb102323cc58f4d4faf7c2a4daeffb8e3ef01a058d4efcf5d264e299c24239"],"state_sha256":"e4cee862249c77d5a5d6532444edb3e076a0008d9e615620770969b1c90595d9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wigHO9ox4TLup7FuBN7g2gbRkdfbfPTKEpU99897K3Swrb1kO4fH19LmJ4mNHRpmmDM7DCDP2zAUCyDGFjZjDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T04:23:30.431519Z","bundle_sha256":"cd9300c4ed82f0c493877d183ba34d697b407e1c131803ccf8e8105c2b42e416"}}