{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:RDACRGACBOWCHQY74KEMELENGN","short_pith_number":"pith:RDACRGAC","schema_version":"1.0","canonical_sha256":"88c02898020bac23c31fe288c22c8d337a41db2a242ca7ceaa23ab8163ba6e6e","source":{"kind":"arxiv","id":"1910.12218","version":1},"attestation_state":"computed","paper":{"title":"A Novel Method to Construct NSSD Molecular Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"\\'Alvaro Nolla de Celis, Bijan Davvaz, Ivan Gutman, Mubasher Umer, Umar Hayat","submitted_at":"2019-10-27T09:33:59Z","abstract_excerpt":"A graph is said to be NSSD (= non-singular with a singular deck) if it has no eigenvalue equal to zero, whereas all its vertex-deleted subgraphs have eigenvalues equal to zero. NSSD graphs are of importance in the theory of conductance of organic compounds. In this paper, a novel method is described for constructing NSSD molecular graphs from the commuting graphs of the $H_v$-group. An algorithm is presented to construct the NSSD graphs from these commuting graphs."},"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":"1910.12218","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-10-27T09:33:59Z","cross_cats_sorted":[],"title_canon_sha256":"e64664e7ead0e719b1cce7a2c8ad844f3450dbffc28432d9df6bf29f2d309ea7","abstract_canon_sha256":"131916335d343103aaa734869b233aa8a6002325ef1906d1c4b3f41d25678bbb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:15:14.216919Z","signature_b64":"VFLDltPRCyUWfLigVBbvnOOjNHZKcH2pr1bm59Z3AS/BAoCUc8YYEtMDiyToVnu4UefYnn7EeSFaL+5R1DK/CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"88c02898020bac23c31fe288c22c8d337a41db2a242ca7ceaa23ab8163ba6e6e","last_reissued_at":"2026-07-05T00:15:14.216539Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:15:14.216539Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Novel Method to Construct NSSD Molecular Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"\\'Alvaro Nolla de Celis, Bijan Davvaz, Ivan Gutman, Mubasher Umer, Umar Hayat","submitted_at":"2019-10-27T09:33:59Z","abstract_excerpt":"A graph is said to be NSSD (= non-singular with a singular deck) if it has no eigenvalue equal to zero, whereas all its vertex-deleted subgraphs have eigenvalues equal to zero. NSSD graphs are of importance in the theory of conductance of organic compounds. In this paper, a novel method is described for constructing NSSD molecular graphs from the commuting graphs of the $H_v$-group. An algorithm is presented to construct the NSSD graphs from these commuting graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1910.12218","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1910.12218/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":"1910.12218","created_at":"2026-07-05T00:15:14.216597+00:00"},{"alias_kind":"arxiv_version","alias_value":"1910.12218v1","created_at":"2026-07-05T00:15:14.216597+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1910.12218","created_at":"2026-07-05T00:15:14.216597+00:00"},{"alias_kind":"pith_short_12","alias_value":"RDACRGACBOWC","created_at":"2026-07-05T00:15:14.216597+00:00"},{"alias_kind":"pith_short_16","alias_value":"RDACRGACBOWCHQY7","created_at":"2026-07-05T00:15:14.216597+00:00"},{"alias_kind":"pith_short_8","alias_value":"RDACRGAC","created_at":"2026-07-05T00:15:14.216597+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/RDACRGACBOWCHQY74KEMELENGN","json":"https://pith.science/pith/RDACRGACBOWCHQY74KEMELENGN.json","graph_json":"https://pith.science/api/pith-number/RDACRGACBOWCHQY74KEMELENGN/graph.json","events_json":"https://pith.science/api/pith-number/RDACRGACBOWCHQY74KEMELENGN/events.json","paper":"https://pith.science/paper/RDACRGAC"},"agent_actions":{"view_html":"https://pith.science/pith/RDACRGACBOWCHQY74KEMELENGN","download_json":"https://pith.science/pith/RDACRGACBOWCHQY74KEMELENGN.json","view_paper":"https://pith.science/paper/RDACRGAC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1910.12218&json=true","fetch_graph":"https://pith.science/api/pith-number/RDACRGACBOWCHQY74KEMELENGN/graph.json","fetch_events":"https://pith.science/api/pith-number/RDACRGACBOWCHQY74KEMELENGN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RDACRGACBOWCHQY74KEMELENGN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RDACRGACBOWCHQY74KEMELENGN/action/storage_attestation","attest_author":"https://pith.science/pith/RDACRGACBOWCHQY74KEMELENGN/action/author_attestation","sign_citation":"https://pith.science/pith/RDACRGACBOWCHQY74KEMELENGN/action/citation_signature","submit_replication":"https://pith.science/pith/RDACRGACBOWCHQY74KEMELENGN/action/replication_record"}},"created_at":"2026-07-05T00:15:14.216597+00:00","updated_at":"2026-07-05T00:15:14.216597+00:00"}