{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:E4D7SREGWLMB2MNLDWR7X26TSR","short_pith_number":"pith:E4D7SREG","schema_version":"1.0","canonical_sha256":"2707f94486b2d81d31ab1da3fbebd39441b11bc1ccc70188bb06b5b2f2bb0ed6","source":{"kind":"arxiv","id":"2102.09292","version":2},"attestation_state":"computed","paper":{"title":"On graphs with exactly one anti-adjacency eigenvalue and beyond","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hakan Kucuk, Jianfeng Wang, Mei Lu, Sezer Sorgun, Xingyu Lei","submitted_at":"2021-02-18T12:14:22Z","abstract_excerpt":"The anti-adjacency matrix of a graph is constructed from the distance matrix of a graph by keeping each row and each column only the largest distances. This matrix can be interpreted as the opposite of the adjacency matrix, which is instead constructed from the distance matrix of a graph by keeping in each row and each column only the distances equal to 1. The (anti-)adjacency eigenvalues of a graph are those of its (anti-)adjacency matrix. Employing a novel technique introduced by Haemers [Spectral characterization of mixed extensions of small graphs, Discrete Math. 342 (2019) 2760--2764], we"},"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":"2102.09292","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-02-18T12:14:22Z","cross_cats_sorted":[],"title_canon_sha256":"a338b90c0f2a22a80fabb35d249ce451d208e46dd15e8a593c5d279b27f46d0f","abstract_canon_sha256":"d2f88ec490f11df3246c6b26986df180571ae9471a14a3593c21f557a6cd3d2e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:26:15.322625Z","signature_b64":"yMqB5JYFRVjThcHt82ZVQiZMpkOB0RXNvWgB1vvlxj35Ksiny9KDXCQ8s/pTsdGVwQGPsN6CTeEOLUogLVrjDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2707f94486b2d81d31ab1da3fbebd39441b11bc1ccc70188bb06b5b2f2bb0ed6","last_reissued_at":"2026-07-05T03:26:15.322152Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:26:15.322152Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On graphs with exactly one anti-adjacency eigenvalue and beyond","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hakan Kucuk, Jianfeng Wang, Mei Lu, Sezer Sorgun, Xingyu Lei","submitted_at":"2021-02-18T12:14:22Z","abstract_excerpt":"The anti-adjacency matrix of a graph is constructed from the distance matrix of a graph by keeping each row and each column only the largest distances. This matrix can be interpreted as the opposite of the adjacency matrix, which is instead constructed from the distance matrix of a graph by keeping in each row and each column only the distances equal to 1. The (anti-)adjacency eigenvalues of a graph are those of its (anti-)adjacency matrix. Employing a novel technique introduced by Haemers [Spectral characterization of mixed extensions of small graphs, Discrete Math. 342 (2019) 2760--2764], we"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2102.09292","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2102.09292/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2102.09292","created_at":"2026-07-05T03:26:15.322207+00:00"},{"alias_kind":"arxiv_version","alias_value":"2102.09292v2","created_at":"2026-07-05T03:26:15.322207+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2102.09292","created_at":"2026-07-05T03:26:15.322207+00:00"},{"alias_kind":"pith_short_12","alias_value":"E4D7SREGWLMB","created_at":"2026-07-05T03:26:15.322207+00:00"},{"alias_kind":"pith_short_16","alias_value":"E4D7SREGWLMB2MNL","created_at":"2026-07-05T03:26:15.322207+00:00"},{"alias_kind":"pith_short_8","alias_value":"E4D7SREG","created_at":"2026-07-05T03:26:15.322207+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/E4D7SREGWLMB2MNLDWR7X26TSR","json":"https://pith.science/pith/E4D7SREGWLMB2MNLDWR7X26TSR.json","graph_json":"https://pith.science/api/pith-number/E4D7SREGWLMB2MNLDWR7X26TSR/graph.json","events_json":"https://pith.science/api/pith-number/E4D7SREGWLMB2MNLDWR7X26TSR/events.json","paper":"https://pith.science/paper/E4D7SREG"},"agent_actions":{"view_html":"https://pith.science/pith/E4D7SREGWLMB2MNLDWR7X26TSR","download_json":"https://pith.science/pith/E4D7SREGWLMB2MNLDWR7X26TSR.json","view_paper":"https://pith.science/paper/E4D7SREG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2102.09292&json=true","fetch_graph":"https://pith.science/api/pith-number/E4D7SREGWLMB2MNLDWR7X26TSR/graph.json","fetch_events":"https://pith.science/api/pith-number/E4D7SREGWLMB2MNLDWR7X26TSR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E4D7SREGWLMB2MNLDWR7X26TSR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E4D7SREGWLMB2MNLDWR7X26TSR/action/storage_attestation","attest_author":"https://pith.science/pith/E4D7SREGWLMB2MNLDWR7X26TSR/action/author_attestation","sign_citation":"https://pith.science/pith/E4D7SREGWLMB2MNLDWR7X26TSR/action/citation_signature","submit_replication":"https://pith.science/pith/E4D7SREGWLMB2MNLDWR7X26TSR/action/replication_record"}},"created_at":"2026-07-05T03:26:15.322207+00:00","updated_at":"2026-07-05T03:26:15.322207+00:00"}