{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:IS3JJIC2SRBKIA5VEINGHWIYCV","short_pith_number":"pith:IS3JJIC2","schema_version":"1.0","canonical_sha256":"44b694a05a9442a403b5221a63d9181550074e1555d2de88992fa3b8e47dd9c6","source":{"kind":"arxiv","id":"2303.13279","version":2},"attestation_state":"computed","paper":{"title":"Combinatorial Parameterized Algorithms for Chemical Descriptors based on Molecular Graph Sparsity","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC","cs.DM"],"primary_cat":"cs.DS","authors_text":"Amir K. Goharshady, Giovanna K. Conrado, Harshit J. Motwani, Sergei Novozhilov","submitted_at":"2023-03-23T14:00:29Z","abstract_excerpt":"We present efficient combinatorial parameterized algorithms for several classical graph-based counting problems in computational chemistry, including (i) Kekule structures, (ii) the Hosoya index, (iii) the Merrifield-Simmons index, and (iv) Graph entropy based on matchings and independent sets. All these problems were known to be #P-complete. Building on the intuition that molecular graphs are often sparse and tree-like, we provide fixed-parameter tractable (FPT) algorithms using treewidth as our parameter. We also provide extensive experimental results over the entire PubChem database of chem"},"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":"2303.13279","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-03-23T14:00:29Z","cross_cats_sorted":["cs.CC","cs.DM"],"title_canon_sha256":"77532dbd4125ac7b7ebb37b0b9d83c9c5369d392caf4297452da799e45b45f48","abstract_canon_sha256":"01a0cfcba5d3c877ff49af24cd5ff0b1ce3aca0f0e12eb52646236f0fb41e9d8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:51:12.912206Z","signature_b64":"567vqimnkLsBxXL+g4N2c8M+fU0e+otfmfhYPkaqpFZX3H+HfmGoQvsKG7eItMfQhnJ4VjEi8+ZgErF1o/ViAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"44b694a05a9442a403b5221a63d9181550074e1555d2de88992fa3b8e47dd9c6","last_reissued_at":"2026-07-05T11:51:12.911657Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:51:12.911657Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Combinatorial Parameterized Algorithms for Chemical Descriptors based on Molecular Graph Sparsity","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC","cs.DM"],"primary_cat":"cs.DS","authors_text":"Amir K. Goharshady, Giovanna K. Conrado, Harshit J. Motwani, Sergei Novozhilov","submitted_at":"2023-03-23T14:00:29Z","abstract_excerpt":"We present efficient combinatorial parameterized algorithms for several classical graph-based counting problems in computational chemistry, including (i) Kekule structures, (ii) the Hosoya index, (iii) the Merrifield-Simmons index, and (iv) Graph entropy based on matchings and independent sets. All these problems were known to be #P-complete. Building on the intuition that molecular graphs are often sparse and tree-like, we provide fixed-parameter tractable (FPT) algorithms using treewidth as our parameter. We also provide extensive experimental results over the entire PubChem database of chem"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.13279","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/2303.13279/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":"2303.13279","created_at":"2026-07-05T11:51:12.911725+00:00"},{"alias_kind":"arxiv_version","alias_value":"2303.13279v2","created_at":"2026-07-05T11:51:12.911725+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.13279","created_at":"2026-07-05T11:51:12.911725+00:00"},{"alias_kind":"pith_short_12","alias_value":"IS3JJIC2SRBK","created_at":"2026-07-05T11:51:12.911725+00:00"},{"alias_kind":"pith_short_16","alias_value":"IS3JJIC2SRBKIA5V","created_at":"2026-07-05T11:51:12.911725+00:00"},{"alias_kind":"pith_short_8","alias_value":"IS3JJIC2","created_at":"2026-07-05T11:51:12.911725+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/IS3JJIC2SRBKIA5VEINGHWIYCV","json":"https://pith.science/pith/IS3JJIC2SRBKIA5VEINGHWIYCV.json","graph_json":"https://pith.science/api/pith-number/IS3JJIC2SRBKIA5VEINGHWIYCV/graph.json","events_json":"https://pith.science/api/pith-number/IS3JJIC2SRBKIA5VEINGHWIYCV/events.json","paper":"https://pith.science/paper/IS3JJIC2"},"agent_actions":{"view_html":"https://pith.science/pith/IS3JJIC2SRBKIA5VEINGHWIYCV","download_json":"https://pith.science/pith/IS3JJIC2SRBKIA5VEINGHWIYCV.json","view_paper":"https://pith.science/paper/IS3JJIC2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2303.13279&json=true","fetch_graph":"https://pith.science/api/pith-number/IS3JJIC2SRBKIA5VEINGHWIYCV/graph.json","fetch_events":"https://pith.science/api/pith-number/IS3JJIC2SRBKIA5VEINGHWIYCV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IS3JJIC2SRBKIA5VEINGHWIYCV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IS3JJIC2SRBKIA5VEINGHWIYCV/action/storage_attestation","attest_author":"https://pith.science/pith/IS3JJIC2SRBKIA5VEINGHWIYCV/action/author_attestation","sign_citation":"https://pith.science/pith/IS3JJIC2SRBKIA5VEINGHWIYCV/action/citation_signature","submit_replication":"https://pith.science/pith/IS3JJIC2SRBKIA5VEINGHWIYCV/action/replication_record"}},"created_at":"2026-07-05T11:51:12.911725+00:00","updated_at":"2026-07-05T11:51:12.911725+00:00"}