{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:OU2GVFTBFPUAPSJEATIYQJ2LTJ","short_pith_number":"pith:OU2GVFTB","canonical_record":{"source":{"id":"1307.5894","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2013-07-22T21:26:00Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"11366e1e93264ff1724769b989f056051556a0904e8c9ce8a4319e3cd69ee12a","abstract_canon_sha256":"0ba121cda77c0bb2bba80f1854df4dc743c10afba84f2bb759efbfcb4104844f"},"schema_version":"1.0"},"canonical_sha256":"75346a96612be807c92404d188274b9a7a0b7df33e9aa9e8b26759ccebdeb0ae","source":{"kind":"arxiv","id":"1307.5894","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.5894","created_at":"2026-05-18T03:17:45Z"},{"alias_kind":"arxiv_version","alias_value":"1307.5894v1","created_at":"2026-05-18T03:17:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.5894","created_at":"2026-05-18T03:17:45Z"},{"alias_kind":"pith_short_12","alias_value":"OU2GVFTBFPUA","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"OU2GVFTBFPUAPSJE","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"OU2GVFTB","created_at":"2026-05-18T12:27:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:OU2GVFTBFPUAPSJEATIYQJ2LTJ","target":"record","payload":{"canonical_record":{"source":{"id":"1307.5894","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2013-07-22T21:26:00Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"11366e1e93264ff1724769b989f056051556a0904e8c9ce8a4319e3cd69ee12a","abstract_canon_sha256":"0ba121cda77c0bb2bba80f1854df4dc743c10afba84f2bb759efbfcb4104844f"},"schema_version":"1.0"},"canonical_sha256":"75346a96612be807c92404d188274b9a7a0b7df33e9aa9e8b26759ccebdeb0ae","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:17:45.859950Z","signature_b64":"tHEn8Gx2nLP9Mfk1ZzmX0emeAMuL5YhWMXV/0heY2EbFNxww06vxZ+dHZvpFxs5ziBXm4boltJjS/1DeSA/hAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"75346a96612be807c92404d188274b9a7a0b7df33e9aa9e8b26759ccebdeb0ae","last_reissued_at":"2026-05-18T03:17:45.859226Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:17:45.859226Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1307.5894","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:17:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iqrYZyE5u7TzFuKvfhSgVQtweX/LjfBYA8JJfH05vlJnnLdd43b4uMi5XFbtjjmsHbRp8evRbuZqSymqt7yeBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T07:06:05.834817Z"},"content_sha256":"f0c5a4d25fdfa3341dba24a4684850947454db74c60858011fc440c3e5d68cba","schema_version":"1.0","event_id":"sha256:f0c5a4d25fdfa3341dba24a4684850947454db74c60858011fc440c3e5d68cba"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:OU2GVFTBFPUAPSJEATIYQJ2LTJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"MIRAGE: An Iterative MapReduce based FrequentSubgraph Mining Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DB","authors_text":"Mansurul A Bhuiyan, Mohammad Al Hasan","submitted_at":"2013-07-22T21:26:00Z","abstract_excerpt":"Frequent subgraph mining (FSM) is an important task for exploratory data analysis on graph data. Over the years, many algorithms have been proposed to solve this task. These algorithms assume that the data structure of the mining task is small enough to fit in the main memory of a computer. However, as the real-world graph data grows, both in size and quantity, such an assumption does not hold any longer. To overcome this, some graph database-centric methods have been proposed in recent years for solving FSM; however, a distributed solution using MapReduce paradigm has not been explored extens"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.5894","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:17:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FkVQaj5RlLGfOnqASb0KjxN3DG5uaPpB/ZTwf3xS+gmQBLwY+On+vbo/vAVz3bbXbIi0UBEP98vej4cZoG+gAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T07:06:05.835326Z"},"content_sha256":"379e32a9b43640f2f96d502a2b47ea81e5a85e0204958a753f0317d9d91f7f8a","schema_version":"1.0","event_id":"sha256:379e32a9b43640f2f96d502a2b47ea81e5a85e0204958a753f0317d9d91f7f8a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OU2GVFTBFPUAPSJEATIYQJ2LTJ/bundle.json","state_url":"https://pith.science/pith/OU2GVFTBFPUAPSJEATIYQJ2LTJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OU2GVFTBFPUAPSJEATIYQJ2LTJ/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-05-26T07:06:05Z","links":{"resolver":"https://pith.science/pith/OU2GVFTBFPUAPSJEATIYQJ2LTJ","bundle":"https://pith.science/pith/OU2GVFTBFPUAPSJEATIYQJ2LTJ/bundle.json","state":"https://pith.science/pith/OU2GVFTBFPUAPSJEATIYQJ2LTJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OU2GVFTBFPUAPSJEATIYQJ2LTJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:OU2GVFTBFPUAPSJEATIYQJ2LTJ","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":"0ba121cda77c0bb2bba80f1854df4dc743c10afba84f2bb759efbfcb4104844f","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2013-07-22T21:26:00Z","title_canon_sha256":"11366e1e93264ff1724769b989f056051556a0904e8c9ce8a4319e3cd69ee12a"},"schema_version":"1.0","source":{"id":"1307.5894","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.5894","created_at":"2026-05-18T03:17:45Z"},{"alias_kind":"arxiv_version","alias_value":"1307.5894v1","created_at":"2026-05-18T03:17:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.5894","created_at":"2026-05-18T03:17:45Z"},{"alias_kind":"pith_short_12","alias_value":"OU2GVFTBFPUA","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"OU2GVFTBFPUAPSJE","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"OU2GVFTB","created_at":"2026-05-18T12:27:54Z"}],"graph_snapshots":[{"event_id":"sha256:379e32a9b43640f2f96d502a2b47ea81e5a85e0204958a753f0317d9d91f7f8a","target":"graph","created_at":"2026-05-18T03:17:45Z","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":"Frequent subgraph mining (FSM) is an important task for exploratory data analysis on graph data. Over the years, many algorithms have been proposed to solve this task. These algorithms assume that the data structure of the mining task is small enough to fit in the main memory of a computer. However, as the real-world graph data grows, both in size and quantity, such an assumption does not hold any longer. To overcome this, some graph database-centric methods have been proposed in recent years for solving FSM; however, a distributed solution using MapReduce paradigm has not been explored extens","authors_text":"Mansurul A Bhuiyan, Mohammad Al Hasan","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2013-07-22T21:26:00Z","title":"MIRAGE: An Iterative MapReduce based FrequentSubgraph Mining Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.5894","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:f0c5a4d25fdfa3341dba24a4684850947454db74c60858011fc440c3e5d68cba","target":"record","created_at":"2026-05-18T03:17:45Z","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":"0ba121cda77c0bb2bba80f1854df4dc743c10afba84f2bb759efbfcb4104844f","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2013-07-22T21:26:00Z","title_canon_sha256":"11366e1e93264ff1724769b989f056051556a0904e8c9ce8a4319e3cd69ee12a"},"schema_version":"1.0","source":{"id":"1307.5894","kind":"arxiv","version":1}},"canonical_sha256":"75346a96612be807c92404d188274b9a7a0b7df33e9aa9e8b26759ccebdeb0ae","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"75346a96612be807c92404d188274b9a7a0b7df33e9aa9e8b26759ccebdeb0ae","first_computed_at":"2026-05-18T03:17:45.859226Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:17:45.859226Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tHEn8Gx2nLP9Mfk1ZzmX0emeAMuL5YhWMXV/0heY2EbFNxww06vxZ+dHZvpFxs5ziBXm4boltJjS/1DeSA/hAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:17:45.859950Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.5894","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f0c5a4d25fdfa3341dba24a4684850947454db74c60858011fc440c3e5d68cba","sha256:379e32a9b43640f2f96d502a2b47ea81e5a85e0204958a753f0317d9d91f7f8a"],"state_sha256":"6efb70e3d779dba31abaee8a37ad3079c699dd0ff9f1a624c2c72bad41c09df3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hh6OpRzexwVMCZQEYVvgcTQJeK4OBWL41JG1M4DFMdOkwxojntM5WSTIPhsL+ZetpDyRpX17pvXwaU9rtTzyDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T07:06:05.838799Z","bundle_sha256":"bb729c9c2576ba980b93e0f07554c5a43bcb720e19a9953ae61b38ac9dedbfcb"}}