{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:WPKOIU5SIIK6E2JXTKBPINDZ5N","short_pith_number":"pith:WPKOIU5S","canonical_record":{"source":{"id":"1102.4480","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-02-22T12:20:18Z","cross_cats_sorted":[],"title_canon_sha256":"8f4b9d4018b31081827b7741c2adf2693209698121a67666f08152e22a6020bd","abstract_canon_sha256":"4c11ec36d55ef420f6876efe4aaa426e1529f2f2271f3755be80ced2f5d472e5"},"schema_version":"1.0"},"canonical_sha256":"b3d4e453b24215e269379a82f43479eb4e7c7ca4a183d8522cce7f1810d7d933","source":{"kind":"arxiv","id":"1102.4480","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.4480","created_at":"2026-05-18T04:27:17Z"},{"alias_kind":"arxiv_version","alias_value":"1102.4480v3","created_at":"2026-05-18T04:27:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.4480","created_at":"2026-05-18T04:27:17Z"},{"alias_kind":"pith_short_12","alias_value":"WPKOIU5SIIK6","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"WPKOIU5SIIK6E2JX","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"WPKOIU5S","created_at":"2026-05-18T12:26:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:WPKOIU5SIIK6E2JXTKBPINDZ5N","target":"record","payload":{"canonical_record":{"source":{"id":"1102.4480","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-02-22T12:20:18Z","cross_cats_sorted":[],"title_canon_sha256":"8f4b9d4018b31081827b7741c2adf2693209698121a67666f08152e22a6020bd","abstract_canon_sha256":"4c11ec36d55ef420f6876efe4aaa426e1529f2f2271f3755be80ced2f5d472e5"},"schema_version":"1.0"},"canonical_sha256":"b3d4e453b24215e269379a82f43479eb4e7c7ca4a183d8522cce7f1810d7d933","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:27:17.481758Z","signature_b64":"relpakPTF9N4QhyPRLU/KhzAUdHS/+MfJxSC+xtlI7a319zhVMBrbNMt4g9qYTcU0d1DF37oQxDiZg1UzxWUBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b3d4e453b24215e269379a82f43479eb4e7c7ca4a183d8522cce7f1810d7d933","last_reissued_at":"2026-05-18T04:27:17.481055Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:27:17.481055Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1102.4480","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-18T04:27:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"glIMHtSJ4Auv5/BEznecDGmOfz5fvgd7AXAZEvDem6qxGnN6P8zbGXb37aAuoMYkHZszvCd87mXUgg2NxBuWCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T20:46:49.804576Z"},"content_sha256":"9ae8f3b8dd6052bf14de08a99d5801b247f105aff868cfd26967d0055c18e560","schema_version":"1.0","event_id":"sha256:9ae8f3b8dd6052bf14de08a99d5801b247f105aff868cfd26967d0055c18e560"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:WPKOIU5SIIK6E2JXTKBPINDZ5N","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"LGM: Mining Frequent Subgraphs from Linear Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Daisuke Okanohara, Koji Tsuda, Shuichi Hirose, Yasuo Tabei","submitted_at":"2011-02-22T12:20:18Z","abstract_excerpt":"A linear graph is a graph whose vertices are totally ordered. Biological and linguistic sequences with interactions among symbols are naturally represented as linear graphs. Examples include protein contact maps, RNA secondary structures and predicate-argument structures. Our algorithm, linear graph miner (LGM), leverages the vertex order for efficient enumeration of frequent subgraphs. Based on the reverse search principle, the pattern space is systematically traversed without expensive duplication checking. Disconnected subgraph patterns are particularly important in linear graphs due to the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.4480","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-18T04:27:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"srBJnaNcPa4eEM4wxbyLZaahHLHE+zJVxteUGklND13PY5wO7VTxIhY5H9ORBrwX8/mZGGjsPRqQgczJnYMTDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T20:46:49.804913Z"},"content_sha256":"3e3efbf33cd241c0d776a5df4fce0bd4e3e7f72d650a3409e24a62b583e5f534","schema_version":"1.0","event_id":"sha256:3e3efbf33cd241c0d776a5df4fce0bd4e3e7f72d650a3409e24a62b583e5f534"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WPKOIU5SIIK6E2JXTKBPINDZ5N/bundle.json","state_url":"https://pith.science/pith/WPKOIU5SIIK6E2JXTKBPINDZ5N/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WPKOIU5SIIK6E2JXTKBPINDZ5N/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-26T20:46:49Z","links":{"resolver":"https://pith.science/pith/WPKOIU5SIIK6E2JXTKBPINDZ5N","bundle":"https://pith.science/pith/WPKOIU5SIIK6E2JXTKBPINDZ5N/bundle.json","state":"https://pith.science/pith/WPKOIU5SIIK6E2JXTKBPINDZ5N/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WPKOIU5SIIK6E2JXTKBPINDZ5N/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:WPKOIU5SIIK6E2JXTKBPINDZ5N","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":"4c11ec36d55ef420f6876efe4aaa426e1529f2f2271f3755be80ced2f5d472e5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-02-22T12:20:18Z","title_canon_sha256":"8f4b9d4018b31081827b7741c2adf2693209698121a67666f08152e22a6020bd"},"schema_version":"1.0","source":{"id":"1102.4480","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.4480","created_at":"2026-05-18T04:27:17Z"},{"alias_kind":"arxiv_version","alias_value":"1102.4480v3","created_at":"2026-05-18T04:27:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.4480","created_at":"2026-05-18T04:27:17Z"},{"alias_kind":"pith_short_12","alias_value":"WPKOIU5SIIK6","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"WPKOIU5SIIK6E2JX","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"WPKOIU5S","created_at":"2026-05-18T12:26:44Z"}],"graph_snapshots":[{"event_id":"sha256:3e3efbf33cd241c0d776a5df4fce0bd4e3e7f72d650a3409e24a62b583e5f534","target":"graph","created_at":"2026-05-18T04:27:17Z","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":"A linear graph is a graph whose vertices are totally ordered. Biological and linguistic sequences with interactions among symbols are naturally represented as linear graphs. Examples include protein contact maps, RNA secondary structures and predicate-argument structures. Our algorithm, linear graph miner (LGM), leverages the vertex order for efficient enumeration of frequent subgraphs. Based on the reverse search principle, the pattern space is systematically traversed without expensive duplication checking. Disconnected subgraph patterns are particularly important in linear graphs due to the","authors_text":"Daisuke Okanohara, Koji Tsuda, Shuichi Hirose, Yasuo Tabei","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-02-22T12:20:18Z","title":"LGM: Mining Frequent Subgraphs from Linear Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.4480","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:9ae8f3b8dd6052bf14de08a99d5801b247f105aff868cfd26967d0055c18e560","target":"record","created_at":"2026-05-18T04:27:17Z","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":"4c11ec36d55ef420f6876efe4aaa426e1529f2f2271f3755be80ced2f5d472e5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-02-22T12:20:18Z","title_canon_sha256":"8f4b9d4018b31081827b7741c2adf2693209698121a67666f08152e22a6020bd"},"schema_version":"1.0","source":{"id":"1102.4480","kind":"arxiv","version":3}},"canonical_sha256":"b3d4e453b24215e269379a82f43479eb4e7c7ca4a183d8522cce7f1810d7d933","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b3d4e453b24215e269379a82f43479eb4e7c7ca4a183d8522cce7f1810d7d933","first_computed_at":"2026-05-18T04:27:17.481055Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:27:17.481055Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"relpakPTF9N4QhyPRLU/KhzAUdHS/+MfJxSC+xtlI7a319zhVMBrbNMt4g9qYTcU0d1DF37oQxDiZg1UzxWUBg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:27:17.481758Z","signed_message":"canonical_sha256_bytes"},"source_id":"1102.4480","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9ae8f3b8dd6052bf14de08a99d5801b247f105aff868cfd26967d0055c18e560","sha256:3e3efbf33cd241c0d776a5df4fce0bd4e3e7f72d650a3409e24a62b583e5f534"],"state_sha256":"7ac385f133c15eeddedfb7700a7e40b9588acd88625ade97bd991180bf635bb8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tWLVnCZzyNozpPoUM53FgwpNetamizjNMGCKEVxxTFy4+IBBAE0mV+qROo59fLUgY+lD6opLnTE5W+3+onSKBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T20:46:49.806912Z","bundle_sha256":"63476ad50e39e18a8fef23f94cd96548b29b896e7daf3bdb89f0d04f711ab265"}}