{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:BMREFX5AW4RSBOPZW7TU7T6MDI","short_pith_number":"pith:BMREFX5A","canonical_record":{"source":{"id":"1712.00208","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-01T06:32:15Z","cross_cats_sorted":[],"title_canon_sha256":"3bb9bf7817f424a437274b56a6cefd19434f26f4b0e6374f611a3198e8b4bf29","abstract_canon_sha256":"b244db40441862525678f0e63f7b77096f3ce85d16a62958f6bb4dec3520488a"},"schema_version":"1.0"},"canonical_sha256":"0b2242dfa0b72320b9f9b7e74fcfcc1a2791706b94aa6e6c0552109113073723","source":{"kind":"arxiv","id":"1712.00208","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.00208","created_at":"2026-05-18T00:29:06Z"},{"alias_kind":"arxiv_version","alias_value":"1712.00208v1","created_at":"2026-05-18T00:29:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.00208","created_at":"2026-05-18T00:29:06Z"},{"alias_kind":"pith_short_12","alias_value":"BMREFX5AW4RS","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"BMREFX5AW4RSBOPZ","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"BMREFX5A","created_at":"2026-05-18T12:31:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:BMREFX5AW4RSBOPZW7TU7T6MDI","target":"record","payload":{"canonical_record":{"source":{"id":"1712.00208","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-01T06:32:15Z","cross_cats_sorted":[],"title_canon_sha256":"3bb9bf7817f424a437274b56a6cefd19434f26f4b0e6374f611a3198e8b4bf29","abstract_canon_sha256":"b244db40441862525678f0e63f7b77096f3ce85d16a62958f6bb4dec3520488a"},"schema_version":"1.0"},"canonical_sha256":"0b2242dfa0b72320b9f9b7e74fcfcc1a2791706b94aa6e6c0552109113073723","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:06.957633Z","signature_b64":"4DyIlI7Rp/JH51BiE+j9j0s92/cw8+zcasPXAS4JKkbJq2Tj/D/TMQkdxIw/648buXS2C3tM0S/UKZIM2wx5Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0b2242dfa0b72320b9f9b7e74fcfcc1a2791706b94aa6e6c0552109113073723","last_reissued_at":"2026-05-18T00:29:06.956862Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:06.956862Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.00208","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:29:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hC6iDMxeOyL+DKMRjoFHcifgHTWexr5tbtQ2UicIJwdgM7YVY/IfSvFIDThFYb2yPdEC5FyydLZ/UbSbxsNSAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T07:49:20.643619Z"},"content_sha256":"1e5042fdb20adf4765315a52f7244cf73afa3aff6860a4fe83060fd5f0ea8f5f","schema_version":"1.0","event_id":"sha256:1e5042fdb20adf4765315a52f7244cf73afa3aff6860a4fe83060fd5f0ea8f5f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:BMREFX5AW4RSBOPZW7TU7T6MDI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The full chracterazation of the graphs with a L-eigenvalue of multiplicity $n-3$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Daijun Yin, Qiongxiang Huang","submitted_at":"2017-12-01T06:32:15Z","abstract_excerpt":"Let $\\mathcal{G}(n,k)$ be the set of connected graphs of order $n$ with one of the Laplacian eigenvalue having multiplicity $k$. It is well known that $\\mathcal{G}(n,n-1)=\\{K_n\\}$. The graphs of $\\mathcal{G}(n,n-2)$ are determined by Das, and the graphs of $\\mathcal{G}(n,n-3)$ with four distinct Laplacian eigenvalues are determined by Mohammadian et al. In this paper, we determine the graphs of $\\mathcal{G}(n,n-3)$ with three distinct Laplacian eigenvalues, and then the full characterization of the graphs in $\\mathcal{G}(n,n-3)$ is completed."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.00208","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:29:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"41tBn8HrOJe9Kx9SZf4jgyNJ70tnGHpXAxzPSd+enupx7m7eSc7JBjUUNLKTNnwjZ8E2ys5uMCUTXamHpd+fCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T07:49:20.643963Z"},"content_sha256":"8749b972c57c85ddd906c72b4fa6aa600492671e662244b7ef04208771fc3ba2","schema_version":"1.0","event_id":"sha256:8749b972c57c85ddd906c72b4fa6aa600492671e662244b7ef04208771fc3ba2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BMREFX5AW4RSBOPZW7TU7T6MDI/bundle.json","state_url":"https://pith.science/pith/BMREFX5AW4RSBOPZW7TU7T6MDI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BMREFX5AW4RSBOPZW7TU7T6MDI/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-01T07:49:20Z","links":{"resolver":"https://pith.science/pith/BMREFX5AW4RSBOPZW7TU7T6MDI","bundle":"https://pith.science/pith/BMREFX5AW4RSBOPZW7TU7T6MDI/bundle.json","state":"https://pith.science/pith/BMREFX5AW4RSBOPZW7TU7T6MDI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BMREFX5AW4RSBOPZW7TU7T6MDI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:BMREFX5AW4RSBOPZW7TU7T6MDI","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":"b244db40441862525678f0e63f7b77096f3ce85d16a62958f6bb4dec3520488a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-01T06:32:15Z","title_canon_sha256":"3bb9bf7817f424a437274b56a6cefd19434f26f4b0e6374f611a3198e8b4bf29"},"schema_version":"1.0","source":{"id":"1712.00208","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.00208","created_at":"2026-05-18T00:29:06Z"},{"alias_kind":"arxiv_version","alias_value":"1712.00208v1","created_at":"2026-05-18T00:29:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.00208","created_at":"2026-05-18T00:29:06Z"},{"alias_kind":"pith_short_12","alias_value":"BMREFX5AW4RS","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"BMREFX5AW4RSBOPZ","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"BMREFX5A","created_at":"2026-05-18T12:31:08Z"}],"graph_snapshots":[{"event_id":"sha256:8749b972c57c85ddd906c72b4fa6aa600492671e662244b7ef04208771fc3ba2","target":"graph","created_at":"2026-05-18T00:29:06Z","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 $\\mathcal{G}(n,k)$ be the set of connected graphs of order $n$ with one of the Laplacian eigenvalue having multiplicity $k$. It is well known that $\\mathcal{G}(n,n-1)=\\{K_n\\}$. The graphs of $\\mathcal{G}(n,n-2)$ are determined by Das, and the graphs of $\\mathcal{G}(n,n-3)$ with four distinct Laplacian eigenvalues are determined by Mohammadian et al. In this paper, we determine the graphs of $\\mathcal{G}(n,n-3)$ with three distinct Laplacian eigenvalues, and then the full characterization of the graphs in $\\mathcal{G}(n,n-3)$ is completed.","authors_text":"Daijun Yin, Qiongxiang Huang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-01T06:32:15Z","title":"The full chracterazation of the graphs with a L-eigenvalue of multiplicity $n-3$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.00208","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:1e5042fdb20adf4765315a52f7244cf73afa3aff6860a4fe83060fd5f0ea8f5f","target":"record","created_at":"2026-05-18T00:29:06Z","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":"b244db40441862525678f0e63f7b77096f3ce85d16a62958f6bb4dec3520488a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-01T06:32:15Z","title_canon_sha256":"3bb9bf7817f424a437274b56a6cefd19434f26f4b0e6374f611a3198e8b4bf29"},"schema_version":"1.0","source":{"id":"1712.00208","kind":"arxiv","version":1}},"canonical_sha256":"0b2242dfa0b72320b9f9b7e74fcfcc1a2791706b94aa6e6c0552109113073723","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0b2242dfa0b72320b9f9b7e74fcfcc1a2791706b94aa6e6c0552109113073723","first_computed_at":"2026-05-18T00:29:06.956862Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:29:06.956862Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4DyIlI7Rp/JH51BiE+j9j0s92/cw8+zcasPXAS4JKkbJq2Tj/D/TMQkdxIw/648buXS2C3tM0S/UKZIM2wx5Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:29:06.957633Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.00208","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1e5042fdb20adf4765315a52f7244cf73afa3aff6860a4fe83060fd5f0ea8f5f","sha256:8749b972c57c85ddd906c72b4fa6aa600492671e662244b7ef04208771fc3ba2"],"state_sha256":"e140d73aed0df9088e56aabcb5af2165996f3d7102319ec8acb0ea3841e89b33"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q+YQjoxheScJGf8sQeo3l94SmhOFSY+E+X9J7FXpzA7wor9b+PVrmhqA0orR9N/yVi2k6aKZgATxy8YxDToWAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T07:49:20.645937Z","bundle_sha256":"a0843694a84f24ab7e56464b1120338ef50f29f13979738f3b2e52ec6e31c6bf"}}