{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:6EXFMJA5JDGPN57OMITAPPMPDQ","short_pith_number":"pith:6EXFMJA5","schema_version":"1.0","canonical_sha256":"f12e56241d48ccf6f7ee622607bd8f1c3e42aab7cb18c034b46d4192cc5e29dc","source":{"kind":"arxiv","id":"1210.0748","version":3},"attestation_state":"computed","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 $"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1210.0748","created_at":"2026-05-18T03:26:41.147013+00:00"},{"alias_kind":"arxiv_version","alias_value":"1210.0748v3","created_at":"2026-05-18T03:26:41.147013+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.0748","created_at":"2026-05-18T03:26:41.147013+00:00"},{"alias_kind":"pith_short_12","alias_value":"6EXFMJA5JDGP","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_16","alias_value":"6EXFMJA5JDGPN57O","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_8","alias_value":"6EXFMJA5","created_at":"2026-05-18T12:26:56.085431+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/6EXFMJA5JDGPN57OMITAPPMPDQ","json":"https://pith.science/pith/6EXFMJA5JDGPN57OMITAPPMPDQ.json","graph_json":"https://pith.science/api/pith-number/6EXFMJA5JDGPN57OMITAPPMPDQ/graph.json","events_json":"https://pith.science/api/pith-number/6EXFMJA5JDGPN57OMITAPPMPDQ/events.json","paper":"https://pith.science/paper/6EXFMJA5"},"agent_actions":{"view_html":"https://pith.science/pith/6EXFMJA5JDGPN57OMITAPPMPDQ","download_json":"https://pith.science/pith/6EXFMJA5JDGPN57OMITAPPMPDQ.json","view_paper":"https://pith.science/paper/6EXFMJA5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1210.0748&json=true","fetch_graph":"https://pith.science/api/pith-number/6EXFMJA5JDGPN57OMITAPPMPDQ/graph.json","fetch_events":"https://pith.science/api/pith-number/6EXFMJA5JDGPN57OMITAPPMPDQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6EXFMJA5JDGPN57OMITAPPMPDQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6EXFMJA5JDGPN57OMITAPPMPDQ/action/storage_attestation","attest_author":"https://pith.science/pith/6EXFMJA5JDGPN57OMITAPPMPDQ/action/author_attestation","sign_citation":"https://pith.science/pith/6EXFMJA5JDGPN57OMITAPPMPDQ/action/citation_signature","submit_replication":"https://pith.science/pith/6EXFMJA5JDGPN57OMITAPPMPDQ/action/replication_record"}},"created_at":"2026-05-18T03:26:41.147013+00:00","updated_at":"2026-05-18T03:26:41.147013+00:00"}