{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:DIPZ7YR47WZH4BPUUH2HFLSKQL","short_pith_number":"pith:DIPZ7YR4","schema_version":"1.0","canonical_sha256":"1a1f9fe23cfdb27e05f4a1f472ae4a82d608c2a4d43477b051f459f092b91c2e","source":{"kind":"arxiv","id":"1804.08263","version":1},"attestation_state":"computed","paper":{"title":"Spectral characterization of the complete graph removing a path of small length","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Lihuan Mao, Sebastian M. Cioab\\u{a}, Wei Wang","submitted_at":"2018-04-23T07:05:26Z","abstract_excerpt":"A graph $G$ is said to be \\emph{determined by its spectrum} if any graph having the same spectrum as $G$ is isomorphic to $G$. Let $K_n \\setminus P_{\\ell}$ be the graph obtained from $K_n$ by removing edges of $P_\\ell$, where $P_\\ell$ is a path of length $\\ell-1$ which is a subgraph of a complete graph $K_n$. C\\'{a}mara and Haemers~\\cite{MC} conjectured that $K_n \\backslash P_{\\ell}$ is determined by its adjacency spectrum for every $2\\leq \\ell \\leq n$. In this paper we show that the conjecture is true for $7\\leq \\ell \\leq9$."},"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":"1804.08263","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-04-23T07:05:26Z","cross_cats_sorted":[],"title_canon_sha256":"713d511325e26db5b5364bb01c071b71b691204298bc3ebc792d944e39154edf","abstract_canon_sha256":"e0229071af07775901cbab8f519c87ec7ec5e4df9daaec47ddd00514be0367bb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:49.022539Z","signature_b64":"Noy0ItNMwxJC12eMLwsQu0+/CDGbUqKz6GJ58dF1Ez6ccekEEuuizuzKDlf1YNR/RU+eBpmmR+C8EZIyEYN2DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1a1f9fe23cfdb27e05f4a1f472ae4a82d608c2a4d43477b051f459f092b91c2e","last_reissued_at":"2026-05-18T00:17:49.021867Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:49.021867Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Spectral characterization of the complete graph removing a path of small length","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Lihuan Mao, Sebastian M. Cioab\\u{a}, Wei Wang","submitted_at":"2018-04-23T07:05:26Z","abstract_excerpt":"A graph $G$ is said to be \\emph{determined by its spectrum} if any graph having the same spectrum as $G$ is isomorphic to $G$. Let $K_n \\setminus P_{\\ell}$ be the graph obtained from $K_n$ by removing edges of $P_\\ell$, where $P_\\ell$ is a path of length $\\ell-1$ which is a subgraph of a complete graph $K_n$. C\\'{a}mara and Haemers~\\cite{MC} conjectured that $K_n \\backslash P_{\\ell}$ is determined by its adjacency spectrum for every $2\\leq \\ell \\leq n$. In this paper we show that the conjecture is true for $7\\leq \\ell \\leq9$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.08263","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":"1804.08263","created_at":"2026-05-18T00:17:49.021956+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.08263v1","created_at":"2026-05-18T00:17:49.021956+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.08263","created_at":"2026-05-18T00:17:49.021956+00:00"},{"alias_kind":"pith_short_12","alias_value":"DIPZ7YR47WZH","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_16","alias_value":"DIPZ7YR47WZH4BPU","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_8","alias_value":"DIPZ7YR4","created_at":"2026-05-18T12:32:19.392346+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/DIPZ7YR47WZH4BPUUH2HFLSKQL","json":"https://pith.science/pith/DIPZ7YR47WZH4BPUUH2HFLSKQL.json","graph_json":"https://pith.science/api/pith-number/DIPZ7YR47WZH4BPUUH2HFLSKQL/graph.json","events_json":"https://pith.science/api/pith-number/DIPZ7YR47WZH4BPUUH2HFLSKQL/events.json","paper":"https://pith.science/paper/DIPZ7YR4"},"agent_actions":{"view_html":"https://pith.science/pith/DIPZ7YR47WZH4BPUUH2HFLSKQL","download_json":"https://pith.science/pith/DIPZ7YR47WZH4BPUUH2HFLSKQL.json","view_paper":"https://pith.science/paper/DIPZ7YR4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.08263&json=true","fetch_graph":"https://pith.science/api/pith-number/DIPZ7YR47WZH4BPUUH2HFLSKQL/graph.json","fetch_events":"https://pith.science/api/pith-number/DIPZ7YR47WZH4BPUUH2HFLSKQL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DIPZ7YR47WZH4BPUUH2HFLSKQL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DIPZ7YR47WZH4BPUUH2HFLSKQL/action/storage_attestation","attest_author":"https://pith.science/pith/DIPZ7YR47WZH4BPUUH2HFLSKQL/action/author_attestation","sign_citation":"https://pith.science/pith/DIPZ7YR47WZH4BPUUH2HFLSKQL/action/citation_signature","submit_replication":"https://pith.science/pith/DIPZ7YR47WZH4BPUUH2HFLSKQL/action/replication_record"}},"created_at":"2026-05-18T00:17:49.021956+00:00","updated_at":"2026-05-18T00:17:49.021956+00:00"}