{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:BNJZWPED36XVPFXHH7NMDYIN7I","short_pith_number":"pith:BNJZWPED","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"},"canonical_sha256":"0b539b3c83dfaf5796e73fdac1e10dfa20d9749d0a1b91abd9bb2f1239d5fffc","source":{"kind":"arxiv","id":"1511.04983","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.04983","created_at":"2026-05-18T01:26:51Z"},{"alias_kind":"arxiv_version","alias_value":"1511.04983v1","created_at":"2026-05-18T01:26:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.04983","created_at":"2026-05-18T01:26:51Z"},{"alias_kind":"pith_short_12","alias_value":"BNJZWPED36XV","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"BNJZWPED36XVPFXH","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"BNJZWPED","created_at":"2026-05-18T12:29:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:BNJZWPED36XVPFXHH7NMDYIN7I","target":"record","payload":{"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"},"canonical_sha256":"0b539b3c83dfaf5796e73fdac1e10dfa20d9749d0a1b91abd9bb2f1239d5fffc","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"},"source_kind":"arxiv","source_id":"1511.04983","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-18T01:26:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3mRV7jJyE3HtiRD9INe9nsPaxlrmsTx+SWld7PUISPcN4TmfcUHEVC+qQOw41o1k3mv24FXB5RBi22zlq1yUDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T18:55:52.475055Z"},"content_sha256":"e93c2f920919b5101968b9843ed22b01030d45590fbaf5721a829ee5c7d23f7e","schema_version":"1.0","event_id":"sha256:e93c2f920919b5101968b9843ed22b01030d45590fbaf5721a829ee5c7d23f7e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:BNJZWPED36XVPFXHH7NMDYIN7I","target":"graph","payload":{"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"},"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-18T01:26:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZHrAAjv+LmfqoSxLsD64pc49XZjVUNMCvyu81khjqCyuIsAH9D4Y4ijUMYcgGp3lcRGMmj3HUCyn95NA3DKaBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T18:55:52.475473Z"},"content_sha256":"eaf6a42b5ad2cf79b5cd503da7a83794a0f055aac179ce37a848b439b279da8a","schema_version":"1.0","event_id":"sha256:eaf6a42b5ad2cf79b5cd503da7a83794a0f055aac179ce37a848b439b279da8a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BNJZWPED36XVPFXHH7NMDYIN7I/bundle.json","state_url":"https://pith.science/pith/BNJZWPED36XVPFXHH7NMDYIN7I/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BNJZWPED36XVPFXHH7NMDYIN7I/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-06T18:55:52Z","links":{"resolver":"https://pith.science/pith/BNJZWPED36XVPFXHH7NMDYIN7I","bundle":"https://pith.science/pith/BNJZWPED36XVPFXHH7NMDYIN7I/bundle.json","state":"https://pith.science/pith/BNJZWPED36XVPFXHH7NMDYIN7I/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BNJZWPED36XVPFXHH7NMDYIN7I/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:BNJZWPED36XVPFXHH7NMDYIN7I","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":"0e3b830fecba5068712941140eb74d7d8cc35ca5b13ca7807dcf9649660edbad","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-11-16T15:11:38Z","title_canon_sha256":"7b88afb8b24013272ae34b8f69fc7e79120dbd3ce58209d0422a162028beca1f"},"schema_version":"1.0","source":{"id":"1511.04983","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.04983","created_at":"2026-05-18T01:26:51Z"},{"alias_kind":"arxiv_version","alias_value":"1511.04983v1","created_at":"2026-05-18T01:26:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.04983","created_at":"2026-05-18T01:26:51Z"},{"alias_kind":"pith_short_12","alias_value":"BNJZWPED36XV","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"BNJZWPED36XVPFXH","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"BNJZWPED","created_at":"2026-05-18T12:29:14Z"}],"graph_snapshots":[{"event_id":"sha256:eaf6a42b5ad2cf79b5cd503da7a83794a0f055aac179ce37a848b439b279da8a","target":"graph","created_at":"2026-05-18T01:26:51Z","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":"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 ","authors_text":"Ligong Wang, Ruosong Yang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-11-16T15:11:38Z","title":"Distance integral complete multipartite graphs with $s=5,6$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.04983","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:e93c2f920919b5101968b9843ed22b01030d45590fbaf5721a829ee5c7d23f7e","target":"record","created_at":"2026-05-18T01:26:51Z","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":"0e3b830fecba5068712941140eb74d7d8cc35ca5b13ca7807dcf9649660edbad","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-11-16T15:11:38Z","title_canon_sha256":"7b88afb8b24013272ae34b8f69fc7e79120dbd3ce58209d0422a162028beca1f"},"schema_version":"1.0","source":{"id":"1511.04983","kind":"arxiv","version":1}},"canonical_sha256":"0b539b3c83dfaf5796e73fdac1e10dfa20d9749d0a1b91abd9bb2f1239d5fffc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0b539b3c83dfaf5796e73fdac1e10dfa20d9749d0a1b91abd9bb2f1239d5fffc","first_computed_at":"2026-05-18T01:26:51.129286Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:26:51.129286Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2m1stS3T20p9io7k+jICcpQuaGMLo2Z781bYc2hKSgRZaNo/qnlua3nXQkPY7kevOZYgAWhKY2o/LUClU8jbDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:26:51.129794Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.04983","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e93c2f920919b5101968b9843ed22b01030d45590fbaf5721a829ee5c7d23f7e","sha256:eaf6a42b5ad2cf79b5cd503da7a83794a0f055aac179ce37a848b439b279da8a"],"state_sha256":"174ac4c9baefc41c8b6d295f293cb68183d30b2262423246eca7e629b25ac2e4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QYvn2w52qPfbHingD4XssiYpCxpDYGi3Dgxw7TBKYB/UYIk1tuBxnl/ir16ZZvILgWKVetJxMK6HbT9oe/02Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T18:55:52.482831Z","bundle_sha256":"ace226c046c79fa3cf08a41d4a8fc37f4bb01cf71f4146c504cd4be2fad585fc"}}