{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:YLZRBA32KWKBRHOBIN22N5HKQQ","short_pith_number":"pith:YLZRBA32","schema_version":"1.0","canonical_sha256":"c2f310837a5594189dc14375a6f4ea841bdba29cae188bec78c394416e793a38","source":{"kind":"arxiv","id":"1506.04054","version":1},"attestation_state":"computed","paper":{"title":"Graph Invertibility and Median Eigenvalues","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bholanath Mandal, Dong Ye, Douglas J. Klein, Yujun Yang","submitted_at":"2015-06-12T15:59:33Z","abstract_excerpt":"Let $(G,w)$ be a weighted graph with a weight-function $w: E(G)\\to \\mathbb R\\backslash\\{0\\}$. A weighted graph $(G,w)$ is invertible to a new weighted graph if its adjacency matrix is invertible. A graph inverse has combinatorial interest and can be applied to bound median eigenvalues of a graph such as have physical meanings in Quatumn Chemistry. In this paper, we characterize the inverse of a weighted graph based on its Sachs subgraphs that are spanning subgraphs with only $K_2$ or cycles (or loops) as components. The characterization can be used to find the inverse of a weighted graph based"},"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":"1506.04054","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-06-12T15:59:33Z","cross_cats_sorted":[],"title_canon_sha256":"4d3cfa022bc54ceb3cbf671fb9e4525abe5f6f37584df72f4af502432da298b1","abstract_canon_sha256":"1bcb21e825033a72a528395f02b63eec103a912b486d18c732f293eaec0216a4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:51:18.452683Z","signature_b64":"zEwuB8KJtGavM4N97ZrTTi/LK4kNEjsfPyIgSq0uGotlmpxhq8k+DVjl6d1DRzUC0UC/Pe0MzEeoTbfAOfpGAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c2f310837a5594189dc14375a6f4ea841bdba29cae188bec78c394416e793a38","last_reissued_at":"2026-05-18T01:51:18.451993Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:51:18.451993Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph Invertibility and Median Eigenvalues","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bholanath Mandal, Dong Ye, Douglas J. Klein, Yujun Yang","submitted_at":"2015-06-12T15:59:33Z","abstract_excerpt":"Let $(G,w)$ be a weighted graph with a weight-function $w: E(G)\\to \\mathbb R\\backslash\\{0\\}$. A weighted graph $(G,w)$ is invertible to a new weighted graph if its adjacency matrix is invertible. A graph inverse has combinatorial interest and can be applied to bound median eigenvalues of a graph such as have physical meanings in Quatumn Chemistry. In this paper, we characterize the inverse of a weighted graph based on its Sachs subgraphs that are spanning subgraphs with only $K_2$ or cycles (or loops) as components. The characterization can be used to find the inverse of a weighted graph based"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.04054","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":"1506.04054","created_at":"2026-05-18T01:51:18.452093+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.04054v1","created_at":"2026-05-18T01:51:18.452093+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.04054","created_at":"2026-05-18T01:51:18.452093+00:00"},{"alias_kind":"pith_short_12","alias_value":"YLZRBA32KWKB","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_16","alias_value":"YLZRBA32KWKBRHOB","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_8","alias_value":"YLZRBA32","created_at":"2026-05-18T12:29:50.041715+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/YLZRBA32KWKBRHOBIN22N5HKQQ","json":"https://pith.science/pith/YLZRBA32KWKBRHOBIN22N5HKQQ.json","graph_json":"https://pith.science/api/pith-number/YLZRBA32KWKBRHOBIN22N5HKQQ/graph.json","events_json":"https://pith.science/api/pith-number/YLZRBA32KWKBRHOBIN22N5HKQQ/events.json","paper":"https://pith.science/paper/YLZRBA32"},"agent_actions":{"view_html":"https://pith.science/pith/YLZRBA32KWKBRHOBIN22N5HKQQ","download_json":"https://pith.science/pith/YLZRBA32KWKBRHOBIN22N5HKQQ.json","view_paper":"https://pith.science/paper/YLZRBA32","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.04054&json=true","fetch_graph":"https://pith.science/api/pith-number/YLZRBA32KWKBRHOBIN22N5HKQQ/graph.json","fetch_events":"https://pith.science/api/pith-number/YLZRBA32KWKBRHOBIN22N5HKQQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YLZRBA32KWKBRHOBIN22N5HKQQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YLZRBA32KWKBRHOBIN22N5HKQQ/action/storage_attestation","attest_author":"https://pith.science/pith/YLZRBA32KWKBRHOBIN22N5HKQQ/action/author_attestation","sign_citation":"https://pith.science/pith/YLZRBA32KWKBRHOBIN22N5HKQQ/action/citation_signature","submit_replication":"https://pith.science/pith/YLZRBA32KWKBRHOBIN22N5HKQQ/action/replication_record"}},"created_at":"2026-05-18T01:51:18.452093+00:00","updated_at":"2026-05-18T01:51:18.452093+00:00"}