{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:2HI6ZJEXQ7RTLAY4F2UWUPUKY4","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"e0036db4ef7196dd338be4cdf6503f0b051ed1c78d1531771247ec44ec64ccee","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-30T10:38:42Z","title_canon_sha256":"3109a070fd737188e941124463dd7bbb5842fc0371ce2c5e563780af2a063916"},"schema_version":"1.0","source":{"id":"1801.00111","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.00111","created_at":"2026-05-18T00:26:59Z"},{"alias_kind":"arxiv_version","alias_value":"1801.00111v1","created_at":"2026-05-18T00:26:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.00111","created_at":"2026-05-18T00:26:59Z"},{"alias_kind":"pith_short_12","alias_value":"2HI6ZJEXQ7RT","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"2HI6ZJEXQ7RTLAY4","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"2HI6ZJEX","created_at":"2026-05-18T12:30:55Z"}],"graph_snapshots":[{"event_id":"sha256:727caa0bab2b20f1ac5b65920f4fa04e0c659f7ce277c7c544cb256ac3fa9be9","target":"graph","created_at":"2026-05-18T00:26:59Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Jozef \\v{S}ir\\'a\\v{n}, So\\v{n}a Pavl\\'ikov\\'a","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-30T10:38:42Z","title":"Inverting non-invertible trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.00111","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:21aee3ad05c6e3d792d89533e362544cfc5b4ea57cca333bb1de214e3b783c97","target":"record","created_at":"2026-05-18T00:26:59Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"e0036db4ef7196dd338be4cdf6503f0b051ed1c78d1531771247ec44ec64ccee","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-30T10:38:42Z","title_canon_sha256":"3109a070fd737188e941124463dd7bbb5842fc0371ce2c5e563780af2a063916"},"schema_version":"1.0","source":{"id":"1801.00111","kind":"arxiv","version":1}},"canonical_sha256":"d1d1eca49787e335831c2ea96a3e8ac7306c947f3114d530fb36cf6589928a47","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d1d1eca49787e335831c2ea96a3e8ac7306c947f3114d530fb36cf6589928a47","first_computed_at":"2026-05-18T00:26:59.390753Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:26:59.390753Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vsz9JpDgjWoj5wo9QLa/A23v+Q+INySWqeghTMvPZIX7snGDOaAE9d6IM1tSfeklv+Ab+jku5/uyosu/VauDAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:26:59.391485Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.00111","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:21aee3ad05c6e3d792d89533e362544cfc5b4ea57cca333bb1de214e3b783c97","sha256:727caa0bab2b20f1ac5b65920f4fa04e0c659f7ce277c7c544cb256ac3fa9be9"],"state_sha256":"8818480b6714754c9961139d7d2daaf52a21a2a2acd3a16930a9c4dc6e2db75a"}