{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:KPHT3GR44CUXX4AEGB63JNLR6N","short_pith_number":"pith:KPHT3GR4","canonical_record":{"source":{"id":"1709.03110","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-09-10T15:05:52Z","cross_cats_sorted":[],"title_canon_sha256":"2473984c7f60f5632de6fd1f209fc91495ac794ad19f2cb51492e934a3bbbf03","abstract_canon_sha256":"60658af213101acb2a144503955e69cd28fcad9500593b3b2d8f44b948a85dce"},"schema_version":"1.0"},"canonical_sha256":"53cf3d9a3ce0a97bf004307db4b571f37f4be6cb68e0a8f8da019ff60c4ec4e5","source":{"kind":"arxiv","id":"1709.03110","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.03110","created_at":"2026-05-18T00:35:39Z"},{"alias_kind":"arxiv_version","alias_value":"1709.03110v1","created_at":"2026-05-18T00:35:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.03110","created_at":"2026-05-18T00:35:39Z"},{"alias_kind":"pith_short_12","alias_value":"KPHT3GR44CUX","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"KPHT3GR44CUXX4AE","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"KPHT3GR4","created_at":"2026-05-18T12:31:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:KPHT3GR44CUXX4AEGB63JNLR6N","target":"record","payload":{"canonical_record":{"source":{"id":"1709.03110","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-09-10T15:05:52Z","cross_cats_sorted":[],"title_canon_sha256":"2473984c7f60f5632de6fd1f209fc91495ac794ad19f2cb51492e934a3bbbf03","abstract_canon_sha256":"60658af213101acb2a144503955e69cd28fcad9500593b3b2d8f44b948a85dce"},"schema_version":"1.0"},"canonical_sha256":"53cf3d9a3ce0a97bf004307db4b571f37f4be6cb68e0a8f8da019ff60c4ec4e5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:39.355343Z","signature_b64":"Eoq+ZdrNRvUup55k/SWRQ+i5QrU0UlbtvRAq/4pT+bRhzlza2ItrzM3W5fCruHU4+VihedZMcyRXrH8pND2FAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"53cf3d9a3ce0a97bf004307db4b571f37f4be6cb68e0a8f8da019ff60c4ec4e5","last_reissued_at":"2026-05-18T00:35:39.354707Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:39.354707Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.03110","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:35:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b/O7ZPdvMYKxs/FgdRAtBh8NRJgpcUL5ywQl22tEZ00fAWrcRstqAOTv+qFYNsZPwgDFYekbYGJGscpOmYaQDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T06:39:41.228069Z"},"content_sha256":"e78429379f08f76badbd63e87bd5d5447131abc046539d66b41b30284ba0e04b","schema_version":"1.0","event_id":"sha256:e78429379f08f76badbd63e87bd5d5447131abc046539d66b41b30284ba0e04b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:KPHT3GR44CUXX4AEGB63JNLR6N","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"G-thinker: Big Graph Mining Made Easier and Faster","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Da Yan, Hongzhi Chen, James Cheng, John C.S. Lui, M.Tamer \\\"Ozsu, Qizhen Zhang","submitted_at":"2017-09-10T15:05:52Z","abstract_excerpt":"This paper proposes a general system for compute-intensive graph mining tasks that find from a big graph all subgraphs that satisfy certain requirements (e.g., graph matching and community detection). Due to the broad range of applications of such tasks, many single-threaded algorithms have been proposed. However, graphs such as online social networks and knowledge graphs often have billions of vertices and edges, which require distributed processing in order to scale. Unfortunately, existing distributed graph processing systems such as Pregel and GraphLab are designed for data-intensive analy"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.03110","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:35:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4BTsXtv+GXQV6YFR64WwhQzVDfomwhtTldd1BUHo6VuDYDEkMgNu/QNjSM1IgLEGnn4WRTFBIo32lOKLDQAmBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T06:39:41.228431Z"},"content_sha256":"e55de5a029d82f036806c60558cb7c33ee56c9d85e352defe9a7ede6eae6d281","schema_version":"1.0","event_id":"sha256:e55de5a029d82f036806c60558cb7c33ee56c9d85e352defe9a7ede6eae6d281"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KPHT3GR44CUXX4AEGB63JNLR6N/bundle.json","state_url":"https://pith.science/pith/KPHT3GR44CUXX4AEGB63JNLR6N/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KPHT3GR44CUXX4AEGB63JNLR6N/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-03T06:39:41Z","links":{"resolver":"https://pith.science/pith/KPHT3GR44CUXX4AEGB63JNLR6N","bundle":"https://pith.science/pith/KPHT3GR44CUXX4AEGB63JNLR6N/bundle.json","state":"https://pith.science/pith/KPHT3GR44CUXX4AEGB63JNLR6N/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KPHT3GR44CUXX4AEGB63JNLR6N/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:KPHT3GR44CUXX4AEGB63JNLR6N","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":"60658af213101acb2a144503955e69cd28fcad9500593b3b2d8f44b948a85dce","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-09-10T15:05:52Z","title_canon_sha256":"2473984c7f60f5632de6fd1f209fc91495ac794ad19f2cb51492e934a3bbbf03"},"schema_version":"1.0","source":{"id":"1709.03110","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.03110","created_at":"2026-05-18T00:35:39Z"},{"alias_kind":"arxiv_version","alias_value":"1709.03110v1","created_at":"2026-05-18T00:35:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.03110","created_at":"2026-05-18T00:35:39Z"},{"alias_kind":"pith_short_12","alias_value":"KPHT3GR44CUX","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"KPHT3GR44CUXX4AE","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"KPHT3GR4","created_at":"2026-05-18T12:31:24Z"}],"graph_snapshots":[{"event_id":"sha256:e55de5a029d82f036806c60558cb7c33ee56c9d85e352defe9a7ede6eae6d281","target":"graph","created_at":"2026-05-18T00:35:39Z","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":"This paper proposes a general system for compute-intensive graph mining tasks that find from a big graph all subgraphs that satisfy certain requirements (e.g., graph matching and community detection). Due to the broad range of applications of such tasks, many single-threaded algorithms have been proposed. However, graphs such as online social networks and knowledge graphs often have billions of vertices and edges, which require distributed processing in order to scale. Unfortunately, existing distributed graph processing systems such as Pregel and GraphLab are designed for data-intensive analy","authors_text":"Da Yan, Hongzhi Chen, James Cheng, John C.S. Lui, M.Tamer \\\"Ozsu, Qizhen Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-09-10T15:05:52Z","title":"G-thinker: Big Graph Mining Made Easier and Faster"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.03110","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:e78429379f08f76badbd63e87bd5d5447131abc046539d66b41b30284ba0e04b","target":"record","created_at":"2026-05-18T00:35:39Z","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":"60658af213101acb2a144503955e69cd28fcad9500593b3b2d8f44b948a85dce","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-09-10T15:05:52Z","title_canon_sha256":"2473984c7f60f5632de6fd1f209fc91495ac794ad19f2cb51492e934a3bbbf03"},"schema_version":"1.0","source":{"id":"1709.03110","kind":"arxiv","version":1}},"canonical_sha256":"53cf3d9a3ce0a97bf004307db4b571f37f4be6cb68e0a8f8da019ff60c4ec4e5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"53cf3d9a3ce0a97bf004307db4b571f37f4be6cb68e0a8f8da019ff60c4ec4e5","first_computed_at":"2026-05-18T00:35:39.354707Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:35:39.354707Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Eoq+ZdrNRvUup55k/SWRQ+i5QrU0UlbtvRAq/4pT+bRhzlza2ItrzM3W5fCruHU4+VihedZMcyRXrH8pND2FAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:35:39.355343Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.03110","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e78429379f08f76badbd63e87bd5d5447131abc046539d66b41b30284ba0e04b","sha256:e55de5a029d82f036806c60558cb7c33ee56c9d85e352defe9a7ede6eae6d281"],"state_sha256":"efc14d47059b9fc3e2bc21a75f307d6029a4ea02db40265e459831b027e92c98"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L4a6UCWbJa8vR44G1uxX/XGbr6QGKuUuofyF0HF98zvGM9gWtoN7/jTU5TcDviGigpRos3fX411UQmoRkY4cBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T06:39:41.230453Z","bundle_sha256":"cba33d1789e0f4518a3a441743dee501e53eeb61818876339396bfdb4f01d4c2"}}