{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:VRZKEPZNHYF7F2G6UG6HNZ3J6Z","short_pith_number":"pith:VRZKEPZN","canonical_record":{"source":{"id":"1611.06535","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-20T15:55:54Z","cross_cats_sorted":[],"title_canon_sha256":"62c3441a93cfbf67b90abb5892ea089296e6c39e61bd7e4bbca82416432b4b2c","abstract_canon_sha256":"9803f1cf099ff88672ae8daa8ec1cf6d6b682831d1db9c4e35fcd080390d75af"},"schema_version":"1.0"},"canonical_sha256":"ac72a23f2d3e0bf2e8dea1bc76e769f669669fa66a743a7db53a3fdf3d05cdc5","source":{"kind":"arxiv","id":"1611.06535","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.06535","created_at":"2026-05-18T00:21:46Z"},{"alias_kind":"arxiv_version","alias_value":"1611.06535v1","created_at":"2026-05-18T00:21:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.06535","created_at":"2026-05-18T00:21:46Z"},{"alias_kind":"pith_short_12","alias_value":"VRZKEPZNHYF7","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"VRZKEPZNHYF7F2G6","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"VRZKEPZN","created_at":"2026-05-18T12:30:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:VRZKEPZNHYF7F2G6UG6HNZ3J6Z","target":"record","payload":{"canonical_record":{"source":{"id":"1611.06535","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-20T15:55:54Z","cross_cats_sorted":[],"title_canon_sha256":"62c3441a93cfbf67b90abb5892ea089296e6c39e61bd7e4bbca82416432b4b2c","abstract_canon_sha256":"9803f1cf099ff88672ae8daa8ec1cf6d6b682831d1db9c4e35fcd080390d75af"},"schema_version":"1.0"},"canonical_sha256":"ac72a23f2d3e0bf2e8dea1bc76e769f669669fa66a743a7db53a3fdf3d05cdc5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:21:46.644483Z","signature_b64":"aexnkZzSaXoFfbEFTTcZb5/Kt/EG8qiqo+S70anSls1OkEVFRDEb0WzfO7JwaG9aMni+ygzYEWVOsVSk+TnLAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ac72a23f2d3e0bf2e8dea1bc76e769f669669fa66a743a7db53a3fdf3d05cdc5","last_reissued_at":"2026-05-18T00:21:46.643866Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:21:46.643866Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.06535","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:21:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HBWWrBg+aK9P/+LiMZgS4h+OTWAIbML1CdV00Tj4DVvZKtOybFDJZqXhYi5QzfmYVDjn++ClpcgeNMIOmTmAAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T04:25:15.712902Z"},"content_sha256":"fdcd9f1e1be8b173220894019b4c754ff9e6122fed455bc654e6b069aed6d016","schema_version":"1.0","event_id":"sha256:fdcd9f1e1be8b173220894019b4c754ff9e6122fed455bc654e6b069aed6d016"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:VRZKEPZNHYF7F2G6UG6HNZ3J6Z","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Inverses of Bipartite Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dong Ye, Yujun Yang","submitted_at":"2016-11-20T15:55:54Z","abstract_excerpt":"Let $G$ be a bipartite graph and its adjacency matrix $\\mathbb A$. If $G$ has a unique perfect matching, then $\\mathbb A$ has an inverse $\\mathbb A^{-1}$ which is a symmetric integral matrix, and hence the adjacency matrix of a multigraph. The inverses of bipartite graphs with unique perfect matchings have a strong connection to M\\\"obius functions of posets. In this note, we characterize all bipartite graphs with a unique perfect matching whose adjacency matrices have inverses diagonally similar to non-negative matrices, which settles an open problem of Godsil on inverses of bipartite graphs i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.06535","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:21:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9R53wlT+M+ZOrPXNG8T9mZGR9Xvz035f8W54fDa4HEA5eUCV7ju9DBcaS5mQr/l27TluhtUGdmIh2wDr/WXbCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T04:25:15.713238Z"},"content_sha256":"3929868168bb9ec187866a6c821b22ca2aefe8048ed30204dd9bd7db501aa978","schema_version":"1.0","event_id":"sha256:3929868168bb9ec187866a6c821b22ca2aefe8048ed30204dd9bd7db501aa978"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VRZKEPZNHYF7F2G6UG6HNZ3J6Z/bundle.json","state_url":"https://pith.science/pith/VRZKEPZNHYF7F2G6UG6HNZ3J6Z/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VRZKEPZNHYF7F2G6UG6HNZ3J6Z/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-07T04:25:15Z","links":{"resolver":"https://pith.science/pith/VRZKEPZNHYF7F2G6UG6HNZ3J6Z","bundle":"https://pith.science/pith/VRZKEPZNHYF7F2G6UG6HNZ3J6Z/bundle.json","state":"https://pith.science/pith/VRZKEPZNHYF7F2G6UG6HNZ3J6Z/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VRZKEPZNHYF7F2G6UG6HNZ3J6Z/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:VRZKEPZNHYF7F2G6UG6HNZ3J6Z","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":"9803f1cf099ff88672ae8daa8ec1cf6d6b682831d1db9c4e35fcd080390d75af","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-20T15:55:54Z","title_canon_sha256":"62c3441a93cfbf67b90abb5892ea089296e6c39e61bd7e4bbca82416432b4b2c"},"schema_version":"1.0","source":{"id":"1611.06535","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.06535","created_at":"2026-05-18T00:21:46Z"},{"alias_kind":"arxiv_version","alias_value":"1611.06535v1","created_at":"2026-05-18T00:21:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.06535","created_at":"2026-05-18T00:21:46Z"},{"alias_kind":"pith_short_12","alias_value":"VRZKEPZNHYF7","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"VRZKEPZNHYF7F2G6","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"VRZKEPZN","created_at":"2026-05-18T12:30:48Z"}],"graph_snapshots":[{"event_id":"sha256:3929868168bb9ec187866a6c821b22ca2aefe8048ed30204dd9bd7db501aa978","target":"graph","created_at":"2026-05-18T00:21:46Z","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":"Let $G$ be a bipartite graph and its adjacency matrix $\\mathbb A$. If $G$ has a unique perfect matching, then $\\mathbb A$ has an inverse $\\mathbb A^{-1}$ which is a symmetric integral matrix, and hence the adjacency matrix of a multigraph. The inverses of bipartite graphs with unique perfect matchings have a strong connection to M\\\"obius functions of posets. In this note, we characterize all bipartite graphs with a unique perfect matching whose adjacency matrices have inverses diagonally similar to non-negative matrices, which settles an open problem of Godsil on inverses of bipartite graphs i","authors_text":"Dong Ye, Yujun Yang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-20T15:55:54Z","title":"Inverses of Bipartite Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.06535","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:fdcd9f1e1be8b173220894019b4c754ff9e6122fed455bc654e6b069aed6d016","target":"record","created_at":"2026-05-18T00:21:46Z","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":"9803f1cf099ff88672ae8daa8ec1cf6d6b682831d1db9c4e35fcd080390d75af","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-20T15:55:54Z","title_canon_sha256":"62c3441a93cfbf67b90abb5892ea089296e6c39e61bd7e4bbca82416432b4b2c"},"schema_version":"1.0","source":{"id":"1611.06535","kind":"arxiv","version":1}},"canonical_sha256":"ac72a23f2d3e0bf2e8dea1bc76e769f669669fa66a743a7db53a3fdf3d05cdc5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ac72a23f2d3e0bf2e8dea1bc76e769f669669fa66a743a7db53a3fdf3d05cdc5","first_computed_at":"2026-05-18T00:21:46.643866Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:21:46.643866Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aexnkZzSaXoFfbEFTTcZb5/Kt/EG8qiqo+S70anSls1OkEVFRDEb0WzfO7JwaG9aMni+ygzYEWVOsVSk+TnLAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:21:46.644483Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.06535","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fdcd9f1e1be8b173220894019b4c754ff9e6122fed455bc654e6b069aed6d016","sha256:3929868168bb9ec187866a6c821b22ca2aefe8048ed30204dd9bd7db501aa978"],"state_sha256":"025261549f98beb694713e443ed9ca5ca7c019450529306ceddd41fd90204d15"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O91RtD4dRppDHWrmSbQTzbnB0LAxvsmYDUw8BCExvx6u7jcOxRTX2nb8g9IXaASo5X2Nf5mYqLtpgbq6AbZEDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T04:25:15.715260Z","bundle_sha256":"463c1bca3b1ce9f807ca256d5a65601ef5135de9023da82c60a1eeb993f87da1"}}