{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:QZNAAM6W5QNW3SWB36Z46WTGZ7","short_pith_number":"pith:QZNAAM6W","schema_version":"1.0","canonical_sha256":"865a0033d6ec1b6dcac1dfb3cf5a66cfeed53a9223b178191c3111b3ea530391","source":{"kind":"arxiv","id":"1905.01921","version":1},"attestation_state":"computed","paper":{"title":"Nonsingular (Vertex-Weighted) Block Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Abraham Berman, Cheng Zheng, Naomi Shaked-Monderer, Ranveer Singh","submitted_at":"2019-05-06T10:51:34Z","abstract_excerpt":"A graph $G$ is \\emph{nonsingular (singular)} if its adjacency matrix $A(G)$ is nonsingular (singular). In this article, we consider the nonsingularity of block graphs, i.e., graphs in which every block is a clique. Extending the problem, we characterize nonsingular vertex-weighted block graphs in terms of reduced vertex-weighted graphs resulting after successive deletion and contraction of pendant blocks. Special cases where nonsingularity of block graphs may be directly determined are discussed."},"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":"1905.01921","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-05-06T10:51:34Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"ebbeba0cc3ee79456681060fdb265c10673bab0b1cf14b58008b3308e1810a44","abstract_canon_sha256":"d1e694838437448c9dc4695697b4d0c118ce64ae2e2f18d12aaebc11eadce8e1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:57.018028Z","signature_b64":"lys4/F/EZU2DcN0Na9bANId47zzQHleiM7XuptrKcxJM8LL6DYdG5hAJ2Sd9QmlxJd0MngAxqDqKHOu3R8BgDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"865a0033d6ec1b6dcac1dfb3cf5a66cfeed53a9223b178191c3111b3ea530391","last_reissued_at":"2026-05-17T23:46:57.017434Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:57.017434Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Nonsingular (Vertex-Weighted) Block Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Abraham Berman, Cheng Zheng, Naomi Shaked-Monderer, Ranveer Singh","submitted_at":"2019-05-06T10:51:34Z","abstract_excerpt":"A graph $G$ is \\emph{nonsingular (singular)} if its adjacency matrix $A(G)$ is nonsingular (singular). In this article, we consider the nonsingularity of block graphs, i.e., graphs in which every block is a clique. Extending the problem, we characterize nonsingular vertex-weighted block graphs in terms of reduced vertex-weighted graphs resulting after successive deletion and contraction of pendant blocks. Special cases where nonsingularity of block graphs may be directly determined are discussed."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.01921","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":"1905.01921","created_at":"2026-05-17T23:46:57.017538+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.01921v1","created_at":"2026-05-17T23:46:57.017538+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.01921","created_at":"2026-05-17T23:46:57.017538+00:00"},{"alias_kind":"pith_short_12","alias_value":"QZNAAM6W5QNW","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_16","alias_value":"QZNAAM6W5QNW3SWB","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_8","alias_value":"QZNAAM6W","created_at":"2026-05-18T12:33:27.125529+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/QZNAAM6W5QNW3SWB36Z46WTGZ7","json":"https://pith.science/pith/QZNAAM6W5QNW3SWB36Z46WTGZ7.json","graph_json":"https://pith.science/api/pith-number/QZNAAM6W5QNW3SWB36Z46WTGZ7/graph.json","events_json":"https://pith.science/api/pith-number/QZNAAM6W5QNW3SWB36Z46WTGZ7/events.json","paper":"https://pith.science/paper/QZNAAM6W"},"agent_actions":{"view_html":"https://pith.science/pith/QZNAAM6W5QNW3SWB36Z46WTGZ7","download_json":"https://pith.science/pith/QZNAAM6W5QNW3SWB36Z46WTGZ7.json","view_paper":"https://pith.science/paper/QZNAAM6W","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.01921&json=true","fetch_graph":"https://pith.science/api/pith-number/QZNAAM6W5QNW3SWB36Z46WTGZ7/graph.json","fetch_events":"https://pith.science/api/pith-number/QZNAAM6W5QNW3SWB36Z46WTGZ7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QZNAAM6W5QNW3SWB36Z46WTGZ7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QZNAAM6W5QNW3SWB36Z46WTGZ7/action/storage_attestation","attest_author":"https://pith.science/pith/QZNAAM6W5QNW3SWB36Z46WTGZ7/action/author_attestation","sign_citation":"https://pith.science/pith/QZNAAM6W5QNW3SWB36Z46WTGZ7/action/citation_signature","submit_replication":"https://pith.science/pith/QZNAAM6W5QNW3SWB36Z46WTGZ7/action/replication_record"}},"created_at":"2026-05-17T23:46:57.017538+00:00","updated_at":"2026-05-17T23:46:57.017538+00:00"}