{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:M5ZVM43N4GKPQJC5DARHLPNHXN","short_pith_number":"pith:M5ZVM43N","schema_version":"1.0","canonical_sha256":"677356736de194f8245d182275bda7bb4654903f34687671c451a6806f74fe39","source":{"kind":"arxiv","id":"1807.04528","version":1},"attestation_state":"computed","paper":{"title":"A new graph modelisation for molecule similarity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Dimitri Watel, Dominique Barth, Franck Quessette, Marc-Antoine Weisser, Olivier David, St\\'efi Nouleho","submitted_at":"2018-07-12T10:38:47Z","abstract_excerpt":"In order to define the process of restrosynthesis of a new organic molecule, it is often necessary to be able to draw inspiration from that of a molecule similar to the target one of which we know such a process. To compute such a similarity, an oftently used approach is to solve a Maximum Common Edge Subgraph (MCES) problem on molecular graphs, but such an approach is limited by computation time and pertinence of similarity measurement. In this paper, we define and analyse here a new graph representation of molecules to algorithmically compare them. The purpose is to model the structure of mo"},"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":"1807.04528","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-12T10:38:47Z","cross_cats_sorted":[],"title_canon_sha256":"d7785a872ca0f805c6c18b1dfa93fde702fcc86c40b3921b6a3ace677e97e6f3","abstract_canon_sha256":"a4b3df30bf35afaec3ea78cace1e84ef6a50dd900932fcbb3498d7718a21163c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:53.178289Z","signature_b64":"agtsUW8uwY0pbepdVSCoyGgQfYK4sNzQ/zPSojS1QBMKBIwN1lMhg+M/BNKc3zurFDSvaIMoRlgAEvnRc0RJDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"677356736de194f8245d182275bda7bb4654903f34687671c451a6806f74fe39","last_reissued_at":"2026-05-18T00:10:53.177611Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:53.177611Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A new graph modelisation for molecule similarity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Dimitri Watel, Dominique Barth, Franck Quessette, Marc-Antoine Weisser, Olivier David, St\\'efi Nouleho","submitted_at":"2018-07-12T10:38:47Z","abstract_excerpt":"In order to define the process of restrosynthesis of a new organic molecule, it is often necessary to be able to draw inspiration from that of a molecule similar to the target one of which we know such a process. To compute such a similarity, an oftently used approach is to solve a Maximum Common Edge Subgraph (MCES) problem on molecular graphs, but such an approach is limited by computation time and pertinence of similarity measurement. In this paper, we define and analyse here a new graph representation of molecules to algorithmically compare them. The purpose is to model the structure of mo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.04528","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1807.04528","created_at":"2026-05-18T00:10:53.177720+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.04528v1","created_at":"2026-05-18T00:10:53.177720+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.04528","created_at":"2026-05-18T00:10:53.177720+00:00"},{"alias_kind":"pith_short_12","alias_value":"M5ZVM43N4GKP","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_16","alias_value":"M5ZVM43N4GKPQJC5","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_8","alias_value":"M5ZVM43N","created_at":"2026-05-18T12:32:37.024351+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/M5ZVM43N4GKPQJC5DARHLPNHXN","json":"https://pith.science/pith/M5ZVM43N4GKPQJC5DARHLPNHXN.json","graph_json":"https://pith.science/api/pith-number/M5ZVM43N4GKPQJC5DARHLPNHXN/graph.json","events_json":"https://pith.science/api/pith-number/M5ZVM43N4GKPQJC5DARHLPNHXN/events.json","paper":"https://pith.science/paper/M5ZVM43N"},"agent_actions":{"view_html":"https://pith.science/pith/M5ZVM43N4GKPQJC5DARHLPNHXN","download_json":"https://pith.science/pith/M5ZVM43N4GKPQJC5DARHLPNHXN.json","view_paper":"https://pith.science/paper/M5ZVM43N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.04528&json=true","fetch_graph":"https://pith.science/api/pith-number/M5ZVM43N4GKPQJC5DARHLPNHXN/graph.json","fetch_events":"https://pith.science/api/pith-number/M5ZVM43N4GKPQJC5DARHLPNHXN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M5ZVM43N4GKPQJC5DARHLPNHXN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M5ZVM43N4GKPQJC5DARHLPNHXN/action/storage_attestation","attest_author":"https://pith.science/pith/M5ZVM43N4GKPQJC5DARHLPNHXN/action/author_attestation","sign_citation":"https://pith.science/pith/M5ZVM43N4GKPQJC5DARHLPNHXN/action/citation_signature","submit_replication":"https://pith.science/pith/M5ZVM43N4GKPQJC5DARHLPNHXN/action/replication_record"}},"created_at":"2026-05-18T00:10:53.177720+00:00","updated_at":"2026-05-18T00:10:53.177720+00:00"}