{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:GVSDZSC4DVBSMDJMSQQRJLZGQG","short_pith_number":"pith:GVSDZSC4","schema_version":"1.0","canonical_sha256":"35643cc85c1d43260d2c942114af2681b69987618885ec5e2f985763c56a4b7a","source":{"kind":"arxiv","id":"2410.09100","version":2},"attestation_state":"computed","paper":{"title":"Rapid Exploration of Assembly Chemical Space of Molecular Graphs","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Gage Siebert, Ian Seet, Keith Y. Patarroyo, Leroy Cronin, Sara I. Walker","submitted_at":"2024-10-09T11:53:42Z","abstract_excerpt":"Quantifying how hard it is to build a molecular graph matters for biosignature detection, chemical complexity, and cheminformatics. We present an exact, scalable algorithm to compute the molecular assembly index (MA) which prioritizes the largest duplicate subgraphs, represents fragmentation with an 'assembly state' array of edge-lists, reuses states via hashing/DAGs, and prunes the search using a dynamic-programming branch-and-bound guided by a conditional-addition-chain lower bound. For organic molecules in the greater than 500 Da range our approach is up to six orders of magnitude faster th"},"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":"2410.09100","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DS","submitted_at":"2024-10-09T11:53:42Z","cross_cats_sorted":[],"title_canon_sha256":"73a8b100ca275a3ab13fdfa5f36dd51ef4c4da8d526e0d5dfbae6472f42b2fd8","abstract_canon_sha256":"086b9094533c81f2e8b3e2a2eab15cda09e467b31267aa719cfcac42e331d0a8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:54:42.180365Z","signature_b64":"6Ir6KWWrYdeT4SdlbxbkdmgHbPBQHN/7pfZGyfoi9IcOesqG4ASdfHf/yEloSbTW9r62VUHvdArm63avi39jDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"35643cc85c1d43260d2c942114af2681b69987618885ec5e2f985763c56a4b7a","last_reissued_at":"2026-07-05T11:54:42.179924Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:54:42.179924Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Rapid Exploration of Assembly Chemical Space of Molecular Graphs","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Gage Siebert, Ian Seet, Keith Y. Patarroyo, Leroy Cronin, Sara I. Walker","submitted_at":"2024-10-09T11:53:42Z","abstract_excerpt":"Quantifying how hard it is to build a molecular graph matters for biosignature detection, chemical complexity, and cheminformatics. We present an exact, scalable algorithm to compute the molecular assembly index (MA) which prioritizes the largest duplicate subgraphs, represents fragmentation with an 'assembly state' array of edge-lists, reuses states via hashing/DAGs, and prunes the search using a dynamic-programming branch-and-bound guided by a conditional-addition-chain lower bound. For organic molecules in the greater than 500 Da range our approach is up to six orders of magnitude faster th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.09100","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2410.09100/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2410.09100","created_at":"2026-07-05T11:54:42.179982+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.09100v2","created_at":"2026-07-05T11:54:42.179982+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.09100","created_at":"2026-07-05T11:54:42.179982+00:00"},{"alias_kind":"pith_short_12","alias_value":"GVSDZSC4DVBS","created_at":"2026-07-05T11:54:42.179982+00:00"},{"alias_kind":"pith_short_16","alias_value":"GVSDZSC4DVBSMDJM","created_at":"2026-07-05T11:54:42.179982+00:00"},{"alias_kind":"pith_short_8","alias_value":"GVSDZSC4","created_at":"2026-07-05T11:54:42.179982+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2510.18900","citing_title":"Foundation Models for Discovery and Exploration in Chemical Space","ref_index":246,"is_internal_anchor":false},{"citing_arxiv_id":"2601.00515","citing_title":"The Physics of Causation","ref_index":28,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GVSDZSC4DVBSMDJMSQQRJLZGQG","json":"https://pith.science/pith/GVSDZSC4DVBSMDJMSQQRJLZGQG.json","graph_json":"https://pith.science/api/pith-number/GVSDZSC4DVBSMDJMSQQRJLZGQG/graph.json","events_json":"https://pith.science/api/pith-number/GVSDZSC4DVBSMDJMSQQRJLZGQG/events.json","paper":"https://pith.science/paper/GVSDZSC4"},"agent_actions":{"view_html":"https://pith.science/pith/GVSDZSC4DVBSMDJMSQQRJLZGQG","download_json":"https://pith.science/pith/GVSDZSC4DVBSMDJMSQQRJLZGQG.json","view_paper":"https://pith.science/paper/GVSDZSC4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.09100&json=true","fetch_graph":"https://pith.science/api/pith-number/GVSDZSC4DVBSMDJMSQQRJLZGQG/graph.json","fetch_events":"https://pith.science/api/pith-number/GVSDZSC4DVBSMDJMSQQRJLZGQG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GVSDZSC4DVBSMDJMSQQRJLZGQG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GVSDZSC4DVBSMDJMSQQRJLZGQG/action/storage_attestation","attest_author":"https://pith.science/pith/GVSDZSC4DVBSMDJMSQQRJLZGQG/action/author_attestation","sign_citation":"https://pith.science/pith/GVSDZSC4DVBSMDJMSQQRJLZGQG/action/citation_signature","submit_replication":"https://pith.science/pith/GVSDZSC4DVBSMDJMSQQRJLZGQG/action/replication_record"}},"created_at":"2026-07-05T11:54:42.179982+00:00","updated_at":"2026-07-05T11:54:42.179982+00:00"}