{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:2HI6ZJEXQ7RTLAY4F2UWUPUKY4","short_pith_number":"pith:2HI6ZJEX","schema_version":"1.0","canonical_sha256":"d1d1eca49787e335831c2ea96a3e8ac7306c947f3114d530fb36cf6589928a47","source":{"kind":"arxiv","id":"1801.00111","version":1},"attestation_state":"computed","paper":{"title":"Inverting non-invertible trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jozef \\v{S}ir\\'a\\v{n}, So\\v{n}a Pavl\\'ikov\\'a","submitted_at":"2017-12-30T10:38:42Z","abstract_excerpt":"If a graph has a non-singular adjacency matrix, then one may use the inverse matrix to define a (labeled) graph that may be considered to be the inverse graph to the original one. It has been known that an adjacency matrix of a tree is non-singular if and only if the tree has a unique perfect matching; in this case the determinant of the matrix turns out to be $\\pm 1$ and the inverse of the tree was shown to be `switching-equivalent' to a simple graph [C. Godsil, Inverses of Trees, Combinatorica 5 (1985), 33--39]. Using generalized inverses of symmetric matrices (that coincide with Moore-Penro"},"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":"1801.00111","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-30T10:38:42Z","cross_cats_sorted":[],"title_canon_sha256":"3109a070fd737188e941124463dd7bbb5842fc0371ce2c5e563780af2a063916","abstract_canon_sha256":"e0036db4ef7196dd338be4cdf6503f0b051ed1c78d1531771247ec44ec64ccee"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:59.391485Z","signature_b64":"vsz9JpDgjWoj5wo9QLa/A23v+Q+INySWqeghTMvPZIX7snGDOaAE9d6IM1tSfeklv+Ab+jku5/uyosu/VauDAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d1d1eca49787e335831c2ea96a3e8ac7306c947f3114d530fb36cf6589928a47","last_reissued_at":"2026-05-18T00:26:59.390753Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:59.390753Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Inverting non-invertible trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jozef \\v{S}ir\\'a\\v{n}, So\\v{n}a Pavl\\'ikov\\'a","submitted_at":"2017-12-30T10:38:42Z","abstract_excerpt":"If a graph has a non-singular adjacency matrix, then one may use the inverse matrix to define a (labeled) graph that may be considered to be the inverse graph to the original one. It has been known that an adjacency matrix of a tree is non-singular if and only if the tree has a unique perfect matching; in this case the determinant of the matrix turns out to be $\\pm 1$ and the inverse of the tree was shown to be `switching-equivalent' to a simple graph [C. Godsil, Inverses of Trees, Combinatorica 5 (1985), 33--39]. Using generalized inverses of symmetric matrices (that coincide with Moore-Penro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.00111","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":"1801.00111","created_at":"2026-05-18T00:26:59.390898+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.00111v1","created_at":"2026-05-18T00:26:59.390898+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.00111","created_at":"2026-05-18T00:26:59.390898+00:00"},{"alias_kind":"pith_short_12","alias_value":"2HI6ZJEXQ7RT","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_16","alias_value":"2HI6ZJEXQ7RTLAY4","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_8","alias_value":"2HI6ZJEX","created_at":"2026-05-18T12:30:55.937587+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/2HI6ZJEXQ7RTLAY4F2UWUPUKY4","json":"https://pith.science/pith/2HI6ZJEXQ7RTLAY4F2UWUPUKY4.json","graph_json":"https://pith.science/api/pith-number/2HI6ZJEXQ7RTLAY4F2UWUPUKY4/graph.json","events_json":"https://pith.science/api/pith-number/2HI6ZJEXQ7RTLAY4F2UWUPUKY4/events.json","paper":"https://pith.science/paper/2HI6ZJEX"},"agent_actions":{"view_html":"https://pith.science/pith/2HI6ZJEXQ7RTLAY4F2UWUPUKY4","download_json":"https://pith.science/pith/2HI6ZJEXQ7RTLAY4F2UWUPUKY4.json","view_paper":"https://pith.science/paper/2HI6ZJEX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.00111&json=true","fetch_graph":"https://pith.science/api/pith-number/2HI6ZJEXQ7RTLAY4F2UWUPUKY4/graph.json","fetch_events":"https://pith.science/api/pith-number/2HI6ZJEXQ7RTLAY4F2UWUPUKY4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2HI6ZJEXQ7RTLAY4F2UWUPUKY4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2HI6ZJEXQ7RTLAY4F2UWUPUKY4/action/storage_attestation","attest_author":"https://pith.science/pith/2HI6ZJEXQ7RTLAY4F2UWUPUKY4/action/author_attestation","sign_citation":"https://pith.science/pith/2HI6ZJEXQ7RTLAY4F2UWUPUKY4/action/citation_signature","submit_replication":"https://pith.science/pith/2HI6ZJEXQ7RTLAY4F2UWUPUKY4/action/replication_record"}},"created_at":"2026-05-18T00:26:59.390898+00:00","updated_at":"2026-05-18T00:26:59.390898+00:00"}