{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:LRYHOKNHO5EOUHOSQCII3IERKX","short_pith_number":"pith:LRYHOKNH","canonical_record":{"source":{"id":"1303.2054","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/publicdomain/","primary_cat":"cs.CE","submitted_at":"2013-03-08T16:57:18Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"60f57b43063f48d666080a897e69d280bf7d573e0ecbdf24c91652912f85d2e5","abstract_canon_sha256":"6fb9aa1308eb26e22845474d2b748b59fb8e0a452d82051091eae533ff83056e"},"schema_version":"1.0"},"canonical_sha256":"5c707729a77748ea1dd280908da09155c0f31e1a09634b6b4676ce4a9358787f","source":{"kind":"arxiv","id":"1303.2054","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.2054","created_at":"2026-05-18T00:22:12Z"},{"alias_kind":"arxiv_version","alias_value":"1303.2054v1","created_at":"2026-05-18T00:22:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.2054","created_at":"2026-05-18T00:22:12Z"},{"alias_kind":"pith_short_12","alias_value":"LRYHOKNHO5EO","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"LRYHOKNHO5EOUHOS","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"LRYHOKNH","created_at":"2026-05-18T12:27:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:LRYHOKNHO5EOUHOSQCII3IERKX","target":"record","payload":{"canonical_record":{"source":{"id":"1303.2054","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/publicdomain/","primary_cat":"cs.CE","submitted_at":"2013-03-08T16:57:18Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"60f57b43063f48d666080a897e69d280bf7d573e0ecbdf24c91652912f85d2e5","abstract_canon_sha256":"6fb9aa1308eb26e22845474d2b748b59fb8e0a452d82051091eae533ff83056e"},"schema_version":"1.0"},"canonical_sha256":"5c707729a77748ea1dd280908da09155c0f31e1a09634b6b4676ce4a9358787f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:12.163777Z","signature_b64":"PV5Ni9Ikxx07EyS06Xyvn28mP3zxz5GlhFpheQrz+qLABsPsoTL611tbpuB3s+jthBfqw53qmOPelfYhjl5lAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5c707729a77748ea1dd280908da09155c0f31e1a09634b6b4676ce4a9358787f","last_reissued_at":"2026-05-18T00:22:12.163229Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:12.163229Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1303.2054","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-18T00:22:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y8iKNqU+yLfSakYjOf7KN4Ryo5McIY9KLVZfybQGogtmLjThvZYSkse36r460+rs1S4La7occrHue8XEv2ZQDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T17:28:46.829962Z"},"content_sha256":"f6e59f15115918ee17de893043e493e75954313ab7eb3d9bca84e997f2c8b50f","schema_version":"1.0","event_id":"sha256:f6e59f15115918ee17de893043e493e75954313ab7eb3d9bca84e997f2c8b50f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:LRYHOKNHO5EOUHOSQCII3IERKX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Mining Representative Unsubstituted Graph Patterns Using Prior Similarity Matrix","license":"http://creativecommons.org/licenses/publicdomain/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CE","authors_text":"Engelbert Mephu Nguifo, Rabie Saidi, Wajdi Dhifli","submitted_at":"2013-03-08T16:57:18Z","abstract_excerpt":"One of the most powerful techniques to study protein structures is to look for recurrent fragments (also called substructures or spatial motifs), then use them as patterns to characterize the proteins under study. An emergent trend consists in parsing proteins three-dimensional (3D) structures into graphs of amino acids. Hence, the search of recurrent spatial motifs is formulated as a process of frequent subgraph discovery where each subgraph represents a spatial motif. In this scope, several efficient approaches for frequent subgraph discovery have been proposed in the literature. However, th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.2054","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-18T00:22:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"prYndYs2lLnoBPB6byWR7tqS/W2m+ikoMka6SCbtQ8iwFDINFI0aMg4T0Oswz0Lvh/IZFsIQP6eCPXNYMRWwBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T17:28:46.830338Z"},"content_sha256":"2adc841e88b9c2632151566373eff19eb654fb81e129f5f884b88a2a4e2535c5","schema_version":"1.0","event_id":"sha256:2adc841e88b9c2632151566373eff19eb654fb81e129f5f884b88a2a4e2535c5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LRYHOKNHO5EOUHOSQCII3IERKX/bundle.json","state_url":"https://pith.science/pith/LRYHOKNHO5EOUHOSQCII3IERKX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LRYHOKNHO5EOUHOSQCII3IERKX/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-27T17:28:46Z","links":{"resolver":"https://pith.science/pith/LRYHOKNHO5EOUHOSQCII3IERKX","bundle":"https://pith.science/pith/LRYHOKNHO5EOUHOSQCII3IERKX/bundle.json","state":"https://pith.science/pith/LRYHOKNHO5EOUHOSQCII3IERKX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LRYHOKNHO5EOUHOSQCII3IERKX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:LRYHOKNHO5EOUHOSQCII3IERKX","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":"6fb9aa1308eb26e22845474d2b748b59fb8e0a452d82051091eae533ff83056e","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/publicdomain/","primary_cat":"cs.CE","submitted_at":"2013-03-08T16:57:18Z","title_canon_sha256":"60f57b43063f48d666080a897e69d280bf7d573e0ecbdf24c91652912f85d2e5"},"schema_version":"1.0","source":{"id":"1303.2054","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.2054","created_at":"2026-05-18T00:22:12Z"},{"alias_kind":"arxiv_version","alias_value":"1303.2054v1","created_at":"2026-05-18T00:22:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.2054","created_at":"2026-05-18T00:22:12Z"},{"alias_kind":"pith_short_12","alias_value":"LRYHOKNHO5EO","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"LRYHOKNHO5EOUHOS","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"LRYHOKNH","created_at":"2026-05-18T12:27:51Z"}],"graph_snapshots":[{"event_id":"sha256:2adc841e88b9c2632151566373eff19eb654fb81e129f5f884b88a2a4e2535c5","target":"graph","created_at":"2026-05-18T00:22:12Z","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":"One of the most powerful techniques to study protein structures is to look for recurrent fragments (also called substructures or spatial motifs), then use them as patterns to characterize the proteins under study. An emergent trend consists in parsing proteins three-dimensional (3D) structures into graphs of amino acids. Hence, the search of recurrent spatial motifs is formulated as a process of frequent subgraph discovery where each subgraph represents a spatial motif. In this scope, several efficient approaches for frequent subgraph discovery have been proposed in the literature. However, th","authors_text":"Engelbert Mephu Nguifo, Rabie Saidi, Wajdi Dhifli","cross_cats":["cs.LG"],"headline":"","license":"http://creativecommons.org/licenses/publicdomain/","primary_cat":"cs.CE","submitted_at":"2013-03-08T16:57:18Z","title":"Mining Representative Unsubstituted Graph Patterns Using Prior Similarity Matrix"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.2054","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:f6e59f15115918ee17de893043e493e75954313ab7eb3d9bca84e997f2c8b50f","target":"record","created_at":"2026-05-18T00:22:12Z","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":"6fb9aa1308eb26e22845474d2b748b59fb8e0a452d82051091eae533ff83056e","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/publicdomain/","primary_cat":"cs.CE","submitted_at":"2013-03-08T16:57:18Z","title_canon_sha256":"60f57b43063f48d666080a897e69d280bf7d573e0ecbdf24c91652912f85d2e5"},"schema_version":"1.0","source":{"id":"1303.2054","kind":"arxiv","version":1}},"canonical_sha256":"5c707729a77748ea1dd280908da09155c0f31e1a09634b6b4676ce4a9358787f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5c707729a77748ea1dd280908da09155c0f31e1a09634b6b4676ce4a9358787f","first_computed_at":"2026-05-18T00:22:12.163229Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:22:12.163229Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PV5Ni9Ikxx07EyS06Xyvn28mP3zxz5GlhFpheQrz+qLABsPsoTL611tbpuB3s+jthBfqw53qmOPelfYhjl5lAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:22:12.163777Z","signed_message":"canonical_sha256_bytes"},"source_id":"1303.2054","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f6e59f15115918ee17de893043e493e75954313ab7eb3d9bca84e997f2c8b50f","sha256:2adc841e88b9c2632151566373eff19eb654fb81e129f5f884b88a2a4e2535c5"],"state_sha256":"d9ac9042f9150dcb2e9582f98d6931625eaa41f4b61946fffa8def0d1b6a6b4b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yfCEgD4pXmIhPIsWMw7AaLL9C8+N7WoJ/lSWIfnEtivcwUTRILD5ptCBJEVTTylKlf8uv5JA8zFiQ44ZxkK9Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T17:28:46.832669Z","bundle_sha256":"49e68107f20ee85cf4880b43bfc22401ce8283c5ec8e7e59bfff507e6f490a32"}}