{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:5PDEJXU5DZJ5ABFYCDOK3R62KT","short_pith_number":"pith:5PDEJXU5","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"},"canonical_sha256":"ebc644de9d1e53d004b810dcadc7da54ed9a04e674c1c954de4dd5c77965fddb","source":{"kind":"arxiv","id":"1707.02210","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.02210","created_at":"2026-05-18T00:02:13Z"},{"alias_kind":"arxiv_version","alias_value":"1707.02210v1","created_at":"2026-05-18T00:02:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.02210","created_at":"2026-05-18T00:02:13Z"},{"alias_kind":"pith_short_12","alias_value":"5PDEJXU5DZJ5","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"5PDEJXU5DZJ5ABFY","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"5PDEJXU5","created_at":"2026-05-18T12:31:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:5PDEJXU5DZJ5ABFYCDOK3R62KT","target":"record","payload":{"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"},"canonical_sha256":"ebc644de9d1e53d004b810dcadc7da54ed9a04e674c1c954de4dd5c77965fddb","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"},"source_kind":"arxiv","source_id":"1707.02210","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:02:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tQjIRKSrNv5JOLW5gf4I6wcIfI0IYhu0L8soCpq9z+qtgtfoADjrziW7KAc4GDfLTN575dYR9oFnaHIohcNNAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T00:18:14.792736Z"},"content_sha256":"f4b9c65315f87f5d7cf319b41c8f2b2e2b2a613943f7a3a7dff84534af8cc897","schema_version":"1.0","event_id":"sha256:f4b9c65315f87f5d7cf319b41c8f2b2e2b2a613943f7a3a7dff84534af8cc897"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:5PDEJXU5DZJ5ABFYCDOK3R62KT","target":"graph","payload":{"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"},"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:02:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nBrRHCT0lMgXSnT3diLWWu6DntF7qbRPEEnAVpNvU9jCvBn9ciZQv5r0/rccp3k9IE/Mg8paxgB0gh4memPODA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T00:18:14.793085Z"},"content_sha256":"4e733232853b2737500d70a83e839bee0066dbf6f5655dd3a048cd784597ad44","schema_version":"1.0","event_id":"sha256:4e733232853b2737500d70a83e839bee0066dbf6f5655dd3a048cd784597ad44"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5PDEJXU5DZJ5ABFYCDOK3R62KT/bundle.json","state_url":"https://pith.science/pith/5PDEJXU5DZJ5ABFYCDOK3R62KT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5PDEJXU5DZJ5ABFYCDOK3R62KT/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-26T00:18:14Z","links":{"resolver":"https://pith.science/pith/5PDEJXU5DZJ5ABFYCDOK3R62KT","bundle":"https://pith.science/pith/5PDEJXU5DZJ5ABFYCDOK3R62KT/bundle.json","state":"https://pith.science/pith/5PDEJXU5DZJ5ABFYCDOK3R62KT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5PDEJXU5DZJ5ABFYCDOK3R62KT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:5PDEJXU5DZJ5ABFYCDOK3R62KT","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":"9be2346af6937d62218f03c759787699cfc00cf212ba0a09de1fe8d3c298493a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-07-05T05:44:17Z","title_canon_sha256":"f9051c8294b6244899caaa3763ecc93ceddafaa958f4d61e43ae12db5724a179"},"schema_version":"1.0","source":{"id":"1707.02210","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.02210","created_at":"2026-05-18T00:02:13Z"},{"alias_kind":"arxiv_version","alias_value":"1707.02210v1","created_at":"2026-05-18T00:02:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.02210","created_at":"2026-05-18T00:02:13Z"},{"alias_kind":"pith_short_12","alias_value":"5PDEJXU5DZJ5","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"5PDEJXU5DZJ5ABFY","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"5PDEJXU5","created_at":"2026-05-18T12:31:00Z"}],"graph_snapshots":[{"event_id":"sha256:4e733232853b2737500d70a83e839bee0066dbf6f5655dd3a048cd784597ad44","target":"graph","created_at":"2026-05-18T00:02:13Z","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":"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","authors_text":"Daniel Sevcovic, Sona Pavlikova","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-07-05T05:44:17Z","title":"On a Construction of Integrally Invertible Graphs and their Spectral Properties"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.02210","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:f4b9c65315f87f5d7cf319b41c8f2b2e2b2a613943f7a3a7dff84534af8cc897","target":"record","created_at":"2026-05-18T00:02:13Z","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":"9be2346af6937d62218f03c759787699cfc00cf212ba0a09de1fe8d3c298493a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-07-05T05:44:17Z","title_canon_sha256":"f9051c8294b6244899caaa3763ecc93ceddafaa958f4d61e43ae12db5724a179"},"schema_version":"1.0","source":{"id":"1707.02210","kind":"arxiv","version":1}},"canonical_sha256":"ebc644de9d1e53d004b810dcadc7da54ed9a04e674c1c954de4dd5c77965fddb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ebc644de9d1e53d004b810dcadc7da54ed9a04e674c1c954de4dd5c77965fddb","first_computed_at":"2026-05-18T00:02:13.468826Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:02:13.468826Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RWPJyS27BAvoycBA0a1PeHG7yRWmHZ1K8Ugoo+BgQg7jDFPP6ioU1Skr2XMqmjAO6dV9nbZfDsAc8Sbbf5p0Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:02:13.469396Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.02210","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f4b9c65315f87f5d7cf319b41c8f2b2e2b2a613943f7a3a7dff84534af8cc897","sha256:4e733232853b2737500d70a83e839bee0066dbf6f5655dd3a048cd784597ad44"],"state_sha256":"ae3c04a77e8b5a8cfb54a3ac8e66582da5dfeed9fd1a61e62ea008f14b8765fe"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BW88ixwMP7/Tj32SmoXQg3zErpnGnkGonijmqbLuqQBU3oTnjgQFPJPqLqUBb8CqTpq3LAhyxs59XTU8SgkOCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T00:18:14.795054Z","bundle_sha256":"b55e4780f2d4375a04a331a723ae9ea551eb58662c48050469371a2f29705917"}}