{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:6EXFMJA5JDGPN57OMITAPPMPDQ","short_pith_number":"pith:6EXFMJA5","canonical_record":{"source":{"id":"1210.0748","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-10-02T12:30:15Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"2fa5bc30094f0284827c3c9976fcb0a70425ecb90547ff28995bff4a0e90671e","abstract_canon_sha256":"23a29bd46ffddc190a6b8c33be5aff5529ecae894d48a8fae077e4cff4c5b608"},"schema_version":"1.0"},"canonical_sha256":"f12e56241d48ccf6f7ee622607bd8f1c3e42aab7cb18c034b46d4192cc5e29dc","source":{"kind":"arxiv","id":"1210.0748","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.0748","created_at":"2026-05-18T03:26:41Z"},{"alias_kind":"arxiv_version","alias_value":"1210.0748v3","created_at":"2026-05-18T03:26:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.0748","created_at":"2026-05-18T03:26:41Z"},{"alias_kind":"pith_short_12","alias_value":"6EXFMJA5JDGP","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"6EXFMJA5JDGPN57O","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"6EXFMJA5","created_at":"2026-05-18T12:26:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:6EXFMJA5JDGPN57OMITAPPMPDQ","target":"record","payload":{"canonical_record":{"source":{"id":"1210.0748","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-10-02T12:30:15Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"2fa5bc30094f0284827c3c9976fcb0a70425ecb90547ff28995bff4a0e90671e","abstract_canon_sha256":"23a29bd46ffddc190a6b8c33be5aff5529ecae894d48a8fae077e4cff4c5b608"},"schema_version":"1.0"},"canonical_sha256":"f12e56241d48ccf6f7ee622607bd8f1c3e42aab7cb18c034b46d4192cc5e29dc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:26:41.147582Z","signature_b64":"AQMm0MNTFsJUjCLghKbSGedU4eKWmeKQq/fxt5nKnB+LgE7Uj5Im8xCocBRbLCS0Ll9+hpZugsRI/CoMlLd3CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f12e56241d48ccf6f7ee622607bd8f1c3e42aab7cb18c034b46d4192cc5e29dc","last_reissued_at":"2026-05-18T03:26:41.146922Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:26:41.146922Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1210.0748","source_version":3,"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:26:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CHXwtPzDA5G4RtlUyb5HDNM6mQLK9kDu6a/rMnuZYDD7t8PGyKKxvGeezi+vrWi6E6ZkykBPio+AfQj23+AiDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T06:18:47.990960Z"},"content_sha256":"bf70441480153488d028ee5b4aa06e061f82ae7a1a7de73b9a88d59d92fbf329","schema_version":"1.0","event_id":"sha256:bf70441480153488d028ee5b4aa06e061f82ae7a1a7de73b9a88d59d92fbf329"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:6EXFMJA5JDGPN57OMITAPPMPDQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"External memory bisimulation reduction of big graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DB","authors_text":"George H. L. Fletcher, Jan Hidders, Paul De Bra, Yongming Luo, Yuqing Wu","submitted_at":"2012-10-02T12:30:15Z","abstract_excerpt":"In this paper, we present, to our knowledge, the first known I/O efficient solutions for computing the k-bisimulation partition of a massive directed graph, and performing maintenance of such a partition upon updates to the underlying graph. Ubiquitous in the theory and application of graph data, bisimulation is a robust notion of node equivalence which intuitively groups together nodes in a graph which share fundamental structural features. k-bisimulation is the standard variant of bisimulation where the topological features of nodes are only considered within a local neighborhood of radius $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.0748","kind":"arxiv","version":3},"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:26:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0tWk5tfOHS1rbNoWlHG9ztBGKhXtcGVOKs30UHakw0rJ3eMdmX6P0LBpRlCCZE2LSleOH9t9y9YtUokWk7pGDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T06:18:47.991312Z"},"content_sha256":"b4df232299bbf6a96d984c90b89c045eb76dfd3be0b91ff6652517344a9bacd0","schema_version":"1.0","event_id":"sha256:b4df232299bbf6a96d984c90b89c045eb76dfd3be0b91ff6652517344a9bacd0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6EXFMJA5JDGPN57OMITAPPMPDQ/bundle.json","state_url":"https://pith.science/pith/6EXFMJA5JDGPN57OMITAPPMPDQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6EXFMJA5JDGPN57OMITAPPMPDQ/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-02T06:18:47Z","links":{"resolver":"https://pith.science/pith/6EXFMJA5JDGPN57OMITAPPMPDQ","bundle":"https://pith.science/pith/6EXFMJA5JDGPN57OMITAPPMPDQ/bundle.json","state":"https://pith.science/pith/6EXFMJA5JDGPN57OMITAPPMPDQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6EXFMJA5JDGPN57OMITAPPMPDQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:6EXFMJA5JDGPN57OMITAPPMPDQ","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":"23a29bd46ffddc190a6b8c33be5aff5529ecae894d48a8fae077e4cff4c5b608","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-10-02T12:30:15Z","title_canon_sha256":"2fa5bc30094f0284827c3c9976fcb0a70425ecb90547ff28995bff4a0e90671e"},"schema_version":"1.0","source":{"id":"1210.0748","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.0748","created_at":"2026-05-18T03:26:41Z"},{"alias_kind":"arxiv_version","alias_value":"1210.0748v3","created_at":"2026-05-18T03:26:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.0748","created_at":"2026-05-18T03:26:41Z"},{"alias_kind":"pith_short_12","alias_value":"6EXFMJA5JDGP","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"6EXFMJA5JDGPN57O","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"6EXFMJA5","created_at":"2026-05-18T12:26:56Z"}],"graph_snapshots":[{"event_id":"sha256:b4df232299bbf6a96d984c90b89c045eb76dfd3be0b91ff6652517344a9bacd0","target":"graph","created_at":"2026-05-18T03:26:41Z","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 this paper, we present, to our knowledge, the first known I/O efficient solutions for computing the k-bisimulation partition of a massive directed graph, and performing maintenance of such a partition upon updates to the underlying graph. Ubiquitous in the theory and application of graph data, bisimulation is a robust notion of node equivalence which intuitively groups together nodes in a graph which share fundamental structural features. k-bisimulation is the standard variant of bisimulation where the topological features of nodes are only considered within a local neighborhood of radius $","authors_text":"George H. L. Fletcher, Jan Hidders, Paul De Bra, Yongming Luo, Yuqing Wu","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-10-02T12:30:15Z","title":"External memory bisimulation reduction of big graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.0748","kind":"arxiv","version":3},"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:bf70441480153488d028ee5b4aa06e061f82ae7a1a7de73b9a88d59d92fbf329","target":"record","created_at":"2026-05-18T03:26:41Z","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":"23a29bd46ffddc190a6b8c33be5aff5529ecae894d48a8fae077e4cff4c5b608","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-10-02T12:30:15Z","title_canon_sha256":"2fa5bc30094f0284827c3c9976fcb0a70425ecb90547ff28995bff4a0e90671e"},"schema_version":"1.0","source":{"id":"1210.0748","kind":"arxiv","version":3}},"canonical_sha256":"f12e56241d48ccf6f7ee622607bd8f1c3e42aab7cb18c034b46d4192cc5e29dc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f12e56241d48ccf6f7ee622607bd8f1c3e42aab7cb18c034b46d4192cc5e29dc","first_computed_at":"2026-05-18T03:26:41.146922Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:26:41.146922Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AQMm0MNTFsJUjCLghKbSGedU4eKWmeKQq/fxt5nKnB+LgE7Uj5Im8xCocBRbLCS0Ll9+hpZugsRI/CoMlLd3CA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:26:41.147582Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.0748","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bf70441480153488d028ee5b4aa06e061f82ae7a1a7de73b9a88d59d92fbf329","sha256:b4df232299bbf6a96d984c90b89c045eb76dfd3be0b91ff6652517344a9bacd0"],"state_sha256":"0515d521ff3e3fe43a6d4f87f9eaf94d5683c070653255511c77e0e0d23a0206"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fM61TwfrhBaeVozuj24RnsJWm32OVsSsn8rZehyqE0D8H/b+F+ZB3VEoG8kMPeJzr6d7lY6l/G58xGsc8FxlAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T06:18:47.993273Z","bundle_sha256":"2f56797189d80a4dc45415ea2fd73b33a36db074a9fdd57b6b7cc58131b5013e"}}