{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:5PDEJXU5DZJ5ABFYCDOK3R62KT","short_pith_number":"pith:5PDEJXU5","schema_version":"1.0","canonical_sha256":"ebc644de9d1e53d004b810dcadc7da54ed9a04e674c1c954de4dd5c77965fddb","source":{"kind":"arxiv","id":"1707.02210","version":1},"attestation_state":"computed","paper":{"title":"On a Construction of Integrally Invertible Graphs and their Spectral Properties","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Daniel Sevcovic, Sona Pavlikova","submitted_at":"2017-07-05T05:44:17Z","abstract_excerpt":"Godsil (1985) defined a graph to be invertible if it has a non-singular adjacency matrix whose inverse is diagonally similar to a nonnegative integral matrix; the graph defined by the last matrix is then the inverse of the original graph. In this paper we call such graphs positively invertible and introduce a new concept of a negatively invertible graph by replacing the adjective `nonnegative' by `nonpositive in Godsil's definition; the graph defined by the negative of the resulting matrix is then the negative inverse of the original graph. We propose new constructions of integrally invertible"},"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":"1707.02210","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-07-05T05:44:17Z","cross_cats_sorted":[],"title_canon_sha256":"f9051c8294b6244899caaa3763ecc93ceddafaa958f4d61e43ae12db5724a179","abstract_canon_sha256":"9be2346af6937d62218f03c759787699cfc00cf212ba0a09de1fe8d3c298493a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:13.469396Z","signature_b64":"RWPJyS27BAvoycBA0a1PeHG7yRWmHZ1K8Ugoo+BgQg7jDFPP6ioU1Skr2XMqmjAO6dV9nbZfDsAc8Sbbf5p0Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ebc644de9d1e53d004b810dcadc7da54ed9a04e674c1c954de4dd5c77965fddb","last_reissued_at":"2026-05-18T00:02:13.468826Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:13.468826Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On a Construction of Integrally Invertible Graphs and their Spectral Properties","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Daniel Sevcovic, Sona Pavlikova","submitted_at":"2017-07-05T05:44:17Z","abstract_excerpt":"Godsil (1985) defined a graph to be invertible if it has a non-singular adjacency matrix whose inverse is diagonally similar to a nonnegative integral matrix; the graph defined by the last matrix is then the inverse of the original graph. In this paper we call such graphs positively invertible and introduce a new concept of a negatively invertible graph by replacing the adjective `nonnegative' by `nonpositive in Godsil's definition; the graph defined by the negative of the resulting matrix is then the negative inverse of the original graph. We propose new constructions of integrally invertible"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.02210","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":"1707.02210","created_at":"2026-05-18T00:02:13.468912+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.02210v1","created_at":"2026-05-18T00:02:13.468912+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.02210","created_at":"2026-05-18T00:02:13.468912+00:00"},{"alias_kind":"pith_short_12","alias_value":"5PDEJXU5DZJ5","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_16","alias_value":"5PDEJXU5DZJ5ABFY","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_8","alias_value":"5PDEJXU5","created_at":"2026-05-18T12:31:00.734936+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/5PDEJXU5DZJ5ABFYCDOK3R62KT","json":"https://pith.science/pith/5PDEJXU5DZJ5ABFYCDOK3R62KT.json","graph_json":"https://pith.science/api/pith-number/5PDEJXU5DZJ5ABFYCDOK3R62KT/graph.json","events_json":"https://pith.science/api/pith-number/5PDEJXU5DZJ5ABFYCDOK3R62KT/events.json","paper":"https://pith.science/paper/5PDEJXU5"},"agent_actions":{"view_html":"https://pith.science/pith/5PDEJXU5DZJ5ABFYCDOK3R62KT","download_json":"https://pith.science/pith/5PDEJXU5DZJ5ABFYCDOK3R62KT.json","view_paper":"https://pith.science/paper/5PDEJXU5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.02210&json=true","fetch_graph":"https://pith.science/api/pith-number/5PDEJXU5DZJ5ABFYCDOK3R62KT/graph.json","fetch_events":"https://pith.science/api/pith-number/5PDEJXU5DZJ5ABFYCDOK3R62KT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5PDEJXU5DZJ5ABFYCDOK3R62KT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5PDEJXU5DZJ5ABFYCDOK3R62KT/action/storage_attestation","attest_author":"https://pith.science/pith/5PDEJXU5DZJ5ABFYCDOK3R62KT/action/author_attestation","sign_citation":"https://pith.science/pith/5PDEJXU5DZJ5ABFYCDOK3R62KT/action/citation_signature","submit_replication":"https://pith.science/pith/5PDEJXU5DZJ5ABFYCDOK3R62KT/action/replication_record"}},"created_at":"2026-05-18T00:02:13.468912+00:00","updated_at":"2026-05-18T00:02:13.468912+00:00"}