{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:BNJZWPED36XVPFXHH7NMDYIN7I","short_pith_number":"pith:BNJZWPED","schema_version":"1.0","canonical_sha256":"0b539b3c83dfaf5796e73fdac1e10dfa20d9749d0a1b91abd9bb2f1239d5fffc","source":{"kind":"arxiv","id":"1511.04983","version":1},"attestation_state":"computed","paper":{"title":"Distance integral complete multipartite graphs with $s=5,6$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ligong Wang, Ruosong Yang","submitted_at":"2015-11-16T15:11:38Z","abstract_excerpt":"Let $D(G)=(d_{ij})_{n\\times n}$ denote the distance matrix of a connected graph $G$ with order $n$, where $d_{ij}$ is equal to the distance between vertices $v_{i}$ and $v_{j}$ in $G$. A graph is called distance integral if all eigenvalues of its distance matrix are integers. In 2014, Yang and Wang gave a sufficient and necessary condition for complete $r$-partite graphs $K_{p_{1},p_{2},\\ldots,p_{r}}=K_{a_{1}\\cdot p_{1},a_{2}\\cdot p_{2},\\ldots,a_{s}\\cdot p_{s}}$ to be distance integral and obtained such distance integral graphs with $s=1,2,3,4$. However distance integral complete multipartite "},"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":"1511.04983","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-11-16T15:11:38Z","cross_cats_sorted":[],"title_canon_sha256":"7b88afb8b24013272ae34b8f69fc7e79120dbd3ce58209d0422a162028beca1f","abstract_canon_sha256":"0e3b830fecba5068712941140eb74d7d8cc35ca5b13ca7807dcf9649660edbad"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:26:51.129794Z","signature_b64":"2m1stS3T20p9io7k+jICcpQuaGMLo2Z781bYc2hKSgRZaNo/qnlua3nXQkPY7kevOZYgAWhKY2o/LUClU8jbDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0b539b3c83dfaf5796e73fdac1e10dfa20d9749d0a1b91abd9bb2f1239d5fffc","last_reissued_at":"2026-05-18T01:26:51.129286Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:26:51.129286Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distance integral complete multipartite graphs with $s=5,6$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ligong Wang, Ruosong Yang","submitted_at":"2015-11-16T15:11:38Z","abstract_excerpt":"Let $D(G)=(d_{ij})_{n\\times n}$ denote the distance matrix of a connected graph $G$ with order $n$, where $d_{ij}$ is equal to the distance between vertices $v_{i}$ and $v_{j}$ in $G$. A graph is called distance integral if all eigenvalues of its distance matrix are integers. In 2014, Yang and Wang gave a sufficient and necessary condition for complete $r$-partite graphs $K_{p_{1},p_{2},\\ldots,p_{r}}=K_{a_{1}\\cdot p_{1},a_{2}\\cdot p_{2},\\ldots,a_{s}\\cdot p_{s}}$ to be distance integral and obtained such distance integral graphs with $s=1,2,3,4$. However distance integral complete multipartite "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.04983","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":"1511.04983","created_at":"2026-05-18T01:26:51.129375+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.04983v1","created_at":"2026-05-18T01:26:51.129375+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.04983","created_at":"2026-05-18T01:26:51.129375+00:00"},{"alias_kind":"pith_short_12","alias_value":"BNJZWPED36XV","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_16","alias_value":"BNJZWPED36XVPFXH","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_8","alias_value":"BNJZWPED","created_at":"2026-05-18T12:29:14.074870+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/BNJZWPED36XVPFXHH7NMDYIN7I","json":"https://pith.science/pith/BNJZWPED36XVPFXHH7NMDYIN7I.json","graph_json":"https://pith.science/api/pith-number/BNJZWPED36XVPFXHH7NMDYIN7I/graph.json","events_json":"https://pith.science/api/pith-number/BNJZWPED36XVPFXHH7NMDYIN7I/events.json","paper":"https://pith.science/paper/BNJZWPED"},"agent_actions":{"view_html":"https://pith.science/pith/BNJZWPED36XVPFXHH7NMDYIN7I","download_json":"https://pith.science/pith/BNJZWPED36XVPFXHH7NMDYIN7I.json","view_paper":"https://pith.science/paper/BNJZWPED","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.04983&json=true","fetch_graph":"https://pith.science/api/pith-number/BNJZWPED36XVPFXHH7NMDYIN7I/graph.json","fetch_events":"https://pith.science/api/pith-number/BNJZWPED36XVPFXHH7NMDYIN7I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BNJZWPED36XVPFXHH7NMDYIN7I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BNJZWPED36XVPFXHH7NMDYIN7I/action/storage_attestation","attest_author":"https://pith.science/pith/BNJZWPED36XVPFXHH7NMDYIN7I/action/author_attestation","sign_citation":"https://pith.science/pith/BNJZWPED36XVPFXHH7NMDYIN7I/action/citation_signature","submit_replication":"https://pith.science/pith/BNJZWPED36XVPFXHH7NMDYIN7I/action/replication_record"}},"created_at":"2026-05-18T01:26:51.129375+00:00","updated_at":"2026-05-18T01:26:51.129375+00:00"}