{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:SM6UTO2YSDPKLNDYRCZOQUTFLA","short_pith_number":"pith:SM6UTO2Y","canonical_record":{"source":{"id":"1110.3879","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2011-10-18T05:48:03Z","cross_cats_sorted":[],"title_canon_sha256":"73839555d3587031ef50eb769b6900be04e81d431c5b7c4d87697e77b895f9b4","abstract_canon_sha256":"05b28c17c0836ca0ada9ad630c78f615ff542d97ef22978acc67f230733a2deb"},"schema_version":"1.0"},"canonical_sha256":"933d49bb5890dea5b47888b2e8526558251b48abd7ce9207b12c6b0331097e98","source":{"kind":"arxiv","id":"1110.3879","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.3879","created_at":"2026-05-18T02:00:09Z"},{"alias_kind":"arxiv_version","alias_value":"1110.3879v1","created_at":"2026-05-18T02:00:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.3879","created_at":"2026-05-18T02:00:09Z"},{"alias_kind":"pith_short_12","alias_value":"SM6UTO2YSDPK","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_16","alias_value":"SM6UTO2YSDPKLNDY","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_8","alias_value":"SM6UTO2Y","created_at":"2026-05-18T12:26:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:SM6UTO2YSDPKLNDYRCZOQUTFLA","target":"record","payload":{"canonical_record":{"source":{"id":"1110.3879","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2011-10-18T05:48:03Z","cross_cats_sorted":[],"title_canon_sha256":"73839555d3587031ef50eb769b6900be04e81d431c5b7c4d87697e77b895f9b4","abstract_canon_sha256":"05b28c17c0836ca0ada9ad630c78f615ff542d97ef22978acc67f230733a2deb"},"schema_version":"1.0"},"canonical_sha256":"933d49bb5890dea5b47888b2e8526558251b48abd7ce9207b12c6b0331097e98","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:00:09.601805Z","signature_b64":"dZ3NteznVkzSCtHrieHMtTJTkAgF4mFXU9Xlo97GtCRUa7XLvsjTOudAkzKvTyYGURAYU7JIcSbC6cH2I6ISCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"933d49bb5890dea5b47888b2e8526558251b48abd7ce9207b12c6b0331097e98","last_reissued_at":"2026-05-18T02:00:09.601103Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:00:09.601103Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1110.3879","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-18T02:00:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GDst1FmLa1abhzvevOBHABJdFQiunVCMgTAcn79XoByQ2b8+VPjxf6nAOyWg9wF3a/oGYsnm5D8N/YyxbjmhBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T05:34:08.630183Z"},"content_sha256":"56fec67c3007e3d7242afd52a3ac4f3d2210aee37ebfe87120de095afd5fbd60","schema_version":"1.0","event_id":"sha256:56fec67c3007e3d7242afd52a3ac4f3d2210aee37ebfe87120de095afd5fbd60"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:SM6UTO2YSDPKLNDYRCZOQUTFLA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"GTRACE-RS: Efficient Graph Sequence Mining using Reverse Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Akihiro Inokuchi, Hiroaki Ikuta, Takashi Washio","submitted_at":"2011-10-18T05:48:03Z","abstract_excerpt":"The mining of frequent subgraphs from labeled graph data has been studied extensively. Furthermore, much attention has recently been paid to frequent pattern mining from graph sequences. A method, called GTRACE, has been proposed to mine frequent patterns from graph sequences under the assumption that changes in graphs are gradual. Although GTRACE mines the frequent patterns efficiently, it still needs substantial computation time to mine the patterns from graph sequences containing large graphs and long sequences. In this paper, we propose a new version of GTRACE that enables efficient mining"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.3879","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-18T02:00:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MMl7nt7DQiSAOxql/3DjodK910ax2lBSX5tz6JSWB4JhYQWJ0Gz/QjskmCHPw9g4UVF4jbERhilc7ov/KoOZAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T05:34:08.630561Z"},"content_sha256":"3f3d4a45afb2d7ee6f0a8a617095c3c4d82073113f0186a942afa527ecec63b5","schema_version":"1.0","event_id":"sha256:3f3d4a45afb2d7ee6f0a8a617095c3c4d82073113f0186a942afa527ecec63b5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SM6UTO2YSDPKLNDYRCZOQUTFLA/bundle.json","state_url":"https://pith.science/pith/SM6UTO2YSDPKLNDYRCZOQUTFLA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SM6UTO2YSDPKLNDYRCZOQUTFLA/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-05T05:34:08Z","links":{"resolver":"https://pith.science/pith/SM6UTO2YSDPKLNDYRCZOQUTFLA","bundle":"https://pith.science/pith/SM6UTO2YSDPKLNDYRCZOQUTFLA/bundle.json","state":"https://pith.science/pith/SM6UTO2YSDPKLNDYRCZOQUTFLA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SM6UTO2YSDPKLNDYRCZOQUTFLA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:SM6UTO2YSDPKLNDYRCZOQUTFLA","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":"05b28c17c0836ca0ada9ad630c78f615ff542d97ef22978acc67f230733a2deb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2011-10-18T05:48:03Z","title_canon_sha256":"73839555d3587031ef50eb769b6900be04e81d431c5b7c4d87697e77b895f9b4"},"schema_version":"1.0","source":{"id":"1110.3879","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.3879","created_at":"2026-05-18T02:00:09Z"},{"alias_kind":"arxiv_version","alias_value":"1110.3879v1","created_at":"2026-05-18T02:00:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.3879","created_at":"2026-05-18T02:00:09Z"},{"alias_kind":"pith_short_12","alias_value":"SM6UTO2YSDPK","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_16","alias_value":"SM6UTO2YSDPKLNDY","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_8","alias_value":"SM6UTO2Y","created_at":"2026-05-18T12:26:41Z"}],"graph_snapshots":[{"event_id":"sha256:3f3d4a45afb2d7ee6f0a8a617095c3c4d82073113f0186a942afa527ecec63b5","target":"graph","created_at":"2026-05-18T02:00:09Z","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":"The mining of frequent subgraphs from labeled graph data has been studied extensively. Furthermore, much attention has recently been paid to frequent pattern mining from graph sequences. A method, called GTRACE, has been proposed to mine frequent patterns from graph sequences under the assumption that changes in graphs are gradual. Although GTRACE mines the frequent patterns efficiently, it still needs substantial computation time to mine the patterns from graph sequences containing large graphs and long sequences. In this paper, we propose a new version of GTRACE that enables efficient mining","authors_text":"Akihiro Inokuchi, Hiroaki Ikuta, Takashi Washio","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2011-10-18T05:48:03Z","title":"GTRACE-RS: Efficient Graph Sequence Mining using Reverse Search"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.3879","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:56fec67c3007e3d7242afd52a3ac4f3d2210aee37ebfe87120de095afd5fbd60","target":"record","created_at":"2026-05-18T02:00:09Z","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":"05b28c17c0836ca0ada9ad630c78f615ff542d97ef22978acc67f230733a2deb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2011-10-18T05:48:03Z","title_canon_sha256":"73839555d3587031ef50eb769b6900be04e81d431c5b7c4d87697e77b895f9b4"},"schema_version":"1.0","source":{"id":"1110.3879","kind":"arxiv","version":1}},"canonical_sha256":"933d49bb5890dea5b47888b2e8526558251b48abd7ce9207b12c6b0331097e98","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"933d49bb5890dea5b47888b2e8526558251b48abd7ce9207b12c6b0331097e98","first_computed_at":"2026-05-18T02:00:09.601103Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:00:09.601103Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dZ3NteznVkzSCtHrieHMtTJTkAgF4mFXU9Xlo97GtCRUa7XLvsjTOudAkzKvTyYGURAYU7JIcSbC6cH2I6ISCA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:00:09.601805Z","signed_message":"canonical_sha256_bytes"},"source_id":"1110.3879","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:56fec67c3007e3d7242afd52a3ac4f3d2210aee37ebfe87120de095afd5fbd60","sha256:3f3d4a45afb2d7ee6f0a8a617095c3c4d82073113f0186a942afa527ecec63b5"],"state_sha256":"16617c065806d1bab5302ca90dfe088df96bb0045d8ea4f964975a76642bccae"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mmrJ6lVGXRrNEXHvhADxKHFNrOKPsB/oFc15rEdRFjLq1Xtbz43cLRnHFPQjU7Rc8woqLPcYTUf6hhAIIjwBBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T05:34:08.632714Z","bundle_sha256":"0ea3178c19bf724217433b10c4d926888483e08e087bb471aea630f9486be32d"}}