{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:YJDS3OTCIUUHUCHN6PPVNYLKEO","short_pith_number":"pith:YJDS3OTC","schema_version":"1.0","canonical_sha256":"c2472dba6245287a08edf3df56e16a23bcaa3377f5d35940e900e77a85003c93","source":{"kind":"arxiv","id":"1108.3588","version":1},"attestation_state":"computed","paper":{"title":"Graph Invertibility","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Cam McLeman, Erin McNicholas","submitted_at":"2011-08-17T22:16:26Z","abstract_excerpt":"Extending the work of Godsil and others, we investigate the notion of the inverse of a graph (specifically, of bipartite graphs with a unique perfect matching). We provide a concise necessary and sufficient condition for the invertibility of such graphs and generalize the notion of invertibility to multigraphs. We examine the question of whether there exists a \"litmus subgraph\" whose bipartiteness determines invertibility. As an application of our invertibility criteria, we quickly describe all invertible unicyclic graphs. Finally, we describe a general combinatorial procedure for iteratively "},"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":"1108.3588","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-08-17T22:16:26Z","cross_cats_sorted":[],"title_canon_sha256":"56c65f08a633e18b30dfbe179447ed4ca879b090bf1780730a7638644af0bec8","abstract_canon_sha256":"37ef4b7481666e8b40d6045af99121dc0f3e9f92ca474f5ad8ca494ab236cb7d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:15:15.894544Z","signature_b64":"xH6NDglQvoDytBIt0T6y6Qsnn3dhFjlBGJ6+fk2onH/tDy/g29qymWb1CTDw8Vv56Ck8hAlaDMllyskQIZLhBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c2472dba6245287a08edf3df56e16a23bcaa3377f5d35940e900e77a85003c93","last_reissued_at":"2026-05-18T04:15:15.893809Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:15:15.893809Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph Invertibility","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Cam McLeman, Erin McNicholas","submitted_at":"2011-08-17T22:16:26Z","abstract_excerpt":"Extending the work of Godsil and others, we investigate the notion of the inverse of a graph (specifically, of bipartite graphs with a unique perfect matching). We provide a concise necessary and sufficient condition for the invertibility of such graphs and generalize the notion of invertibility to multigraphs. We examine the question of whether there exists a \"litmus subgraph\" whose bipartiteness determines invertibility. As an application of our invertibility criteria, we quickly describe all invertible unicyclic graphs. Finally, we describe a general combinatorial procedure for iteratively "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.3588","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":"1108.3588","created_at":"2026-05-18T04:15:15.893919+00:00"},{"alias_kind":"arxiv_version","alias_value":"1108.3588v1","created_at":"2026-05-18T04:15:15.893919+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.3588","created_at":"2026-05-18T04:15:15.893919+00:00"},{"alias_kind":"pith_short_12","alias_value":"YJDS3OTCIUUH","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_16","alias_value":"YJDS3OTCIUUHUCHN","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_8","alias_value":"YJDS3OTC","created_at":"2026-05-18T12:26:47.523578+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/YJDS3OTCIUUHUCHN6PPVNYLKEO","json":"https://pith.science/pith/YJDS3OTCIUUHUCHN6PPVNYLKEO.json","graph_json":"https://pith.science/api/pith-number/YJDS3OTCIUUHUCHN6PPVNYLKEO/graph.json","events_json":"https://pith.science/api/pith-number/YJDS3OTCIUUHUCHN6PPVNYLKEO/events.json","paper":"https://pith.science/paper/YJDS3OTC"},"agent_actions":{"view_html":"https://pith.science/pith/YJDS3OTCIUUHUCHN6PPVNYLKEO","download_json":"https://pith.science/pith/YJDS3OTCIUUHUCHN6PPVNYLKEO.json","view_paper":"https://pith.science/paper/YJDS3OTC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1108.3588&json=true","fetch_graph":"https://pith.science/api/pith-number/YJDS3OTCIUUHUCHN6PPVNYLKEO/graph.json","fetch_events":"https://pith.science/api/pith-number/YJDS3OTCIUUHUCHN6PPVNYLKEO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YJDS3OTCIUUHUCHN6PPVNYLKEO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YJDS3OTCIUUHUCHN6PPVNYLKEO/action/storage_attestation","attest_author":"https://pith.science/pith/YJDS3OTCIUUHUCHN6PPVNYLKEO/action/author_attestation","sign_citation":"https://pith.science/pith/YJDS3OTCIUUHUCHN6PPVNYLKEO/action/citation_signature","submit_replication":"https://pith.science/pith/YJDS3OTCIUUHUCHN6PPVNYLKEO/action/replication_record"}},"created_at":"2026-05-18T04:15:15.893919+00:00","updated_at":"2026-05-18T04:15:15.893919+00:00"}