{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:T46KHWTUFOC7OVVVIAC34BR27H","short_pith_number":"pith:T46KHWTU","canonical_record":{"source":{"id":"1609.05347","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-17T14:58:38Z","cross_cats_sorted":[],"title_canon_sha256":"09b3d078600a245325df9b46748837f677667180509e5668bc361e531a9be4a8","abstract_canon_sha256":"b20dabd9139559060632c7986a03bd28a643f267dccca0a137e9b818cb27bc9a"},"schema_version":"1.0"},"canonical_sha256":"9f3ca3da742b85f756b54005be063af9ec0320bed6a1d57e538ed17415e93cd9","source":{"kind":"arxiv","id":"1609.05347","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.05347","created_at":"2026-05-18T01:04:26Z"},{"alias_kind":"arxiv_version","alias_value":"1609.05347v1","created_at":"2026-05-18T01:04:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.05347","created_at":"2026-05-18T01:04:26Z"},{"alias_kind":"pith_short_12","alias_value":"T46KHWTUFOC7","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"T46KHWTUFOC7OVVV","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"T46KHWTU","created_at":"2026-05-18T12:30:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:T46KHWTUFOC7OVVVIAC34BR27H","target":"record","payload":{"canonical_record":{"source":{"id":"1609.05347","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-17T14:58:38Z","cross_cats_sorted":[],"title_canon_sha256":"09b3d078600a245325df9b46748837f677667180509e5668bc361e531a9be4a8","abstract_canon_sha256":"b20dabd9139559060632c7986a03bd28a643f267dccca0a137e9b818cb27bc9a"},"schema_version":"1.0"},"canonical_sha256":"9f3ca3da742b85f756b54005be063af9ec0320bed6a1d57e538ed17415e93cd9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:26.667595Z","signature_b64":"v8BZA6LyaPIphfXjMiN2/9QZrhRWP4KZo/YABFgzeRZzdufNVG9DIXQjlz0AAx7T2eaDxSOtUyWCpr0RBavHDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9f3ca3da742b85f756b54005be063af9ec0320bed6a1d57e538ed17415e93cd9","last_reissued_at":"2026-05-18T01:04:26.666955Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:26.666955Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1609.05347","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:04:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8QDLc17AI1JYoziUwSUVHHT0dKz3KoAX8oMflOCW92icP+rAwi3gpV3DOGSLAgbxplF7iArPpseU+NJD2VPDDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T02:07:48.240921Z"},"content_sha256":"262b74a64b3343c6f33c802c553e4a529eb2aec6f3a270b277ccde091461e461","schema_version":"1.0","event_id":"sha256:262b74a64b3343c6f33c802c553e4a529eb2aec6f3a270b277ccde091461e461"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:T46KHWTUFOC7OVVVIAC34BR27H","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The existence of the graphs that have exactly two main eigenvalues","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Lin Chen, Qiongxiang Huang","submitted_at":"2016-09-17T14:58:38Z","abstract_excerpt":"An eigenvalue of a graph $G$ is called a main eigenvalue if it has an eigenvector the sum of whose entries is not equal to zero. It is well known that a graph $G$ has exactly two main eigenvalues if and only if there exists a unique pair of integers $a$ and $b$ such that $\\sum_{u\\in N(v)}d(u)=ad(v)+b$ for every vertex $v\\in V(G)$. We collect such connected graph $G$ in the set $\\mathscr{G}(a,b)$. In this paper, we mainly focus to the existence of such $a$ and $b$, and give the necessary and sufficient condition for $\\mathscr{G}(a,b)\\neq\\emptyset$. In addition, we give the bound for the vertex "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.05347","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:04:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gn44bKArY7Ifjo6m8fo9fye2UQFIwQw1f2Hd/28LMyXaI7mxuIQT1IqMsstffxqHnWzJ/cty7k16qHogfIOMBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T02:07:48.241628Z"},"content_sha256":"655f91bb29fd6911800e8776e280d18507c51753f2c0ebf2e30f37f9586d58aa","schema_version":"1.0","event_id":"sha256:655f91bb29fd6911800e8776e280d18507c51753f2c0ebf2e30f37f9586d58aa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/T46KHWTUFOC7OVVVIAC34BR27H/bundle.json","state_url":"https://pith.science/pith/T46KHWTUFOC7OVVVIAC34BR27H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/T46KHWTUFOC7OVVVIAC34BR27H/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-01T02:07:48Z","links":{"resolver":"https://pith.science/pith/T46KHWTUFOC7OVVVIAC34BR27H","bundle":"https://pith.science/pith/T46KHWTUFOC7OVVVIAC34BR27H/bundle.json","state":"https://pith.science/pith/T46KHWTUFOC7OVVVIAC34BR27H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/T46KHWTUFOC7OVVVIAC34BR27H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:T46KHWTUFOC7OVVVIAC34BR27H","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":"b20dabd9139559060632c7986a03bd28a643f267dccca0a137e9b818cb27bc9a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-17T14:58:38Z","title_canon_sha256":"09b3d078600a245325df9b46748837f677667180509e5668bc361e531a9be4a8"},"schema_version":"1.0","source":{"id":"1609.05347","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.05347","created_at":"2026-05-18T01:04:26Z"},{"alias_kind":"arxiv_version","alias_value":"1609.05347v1","created_at":"2026-05-18T01:04:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.05347","created_at":"2026-05-18T01:04:26Z"},{"alias_kind":"pith_short_12","alias_value":"T46KHWTUFOC7","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"T46KHWTUFOC7OVVV","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"T46KHWTU","created_at":"2026-05-18T12:30:44Z"}],"graph_snapshots":[{"event_id":"sha256:655f91bb29fd6911800e8776e280d18507c51753f2c0ebf2e30f37f9586d58aa","target":"graph","created_at":"2026-05-18T01:04:26Z","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":"An eigenvalue of a graph $G$ is called a main eigenvalue if it has an eigenvector the sum of whose entries is not equal to zero. It is well known that a graph $G$ has exactly two main eigenvalues if and only if there exists a unique pair of integers $a$ and $b$ such that $\\sum_{u\\in N(v)}d(u)=ad(v)+b$ for every vertex $v\\in V(G)$. We collect such connected graph $G$ in the set $\\mathscr{G}(a,b)$. In this paper, we mainly focus to the existence of such $a$ and $b$, and give the necessary and sufficient condition for $\\mathscr{G}(a,b)\\neq\\emptyset$. In addition, we give the bound for the vertex ","authors_text":"Lin Chen, Qiongxiang Huang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-17T14:58:38Z","title":"The existence of the graphs that have exactly two main eigenvalues"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.05347","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:262b74a64b3343c6f33c802c553e4a529eb2aec6f3a270b277ccde091461e461","target":"record","created_at":"2026-05-18T01:04:26Z","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":"b20dabd9139559060632c7986a03bd28a643f267dccca0a137e9b818cb27bc9a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-17T14:58:38Z","title_canon_sha256":"09b3d078600a245325df9b46748837f677667180509e5668bc361e531a9be4a8"},"schema_version":"1.0","source":{"id":"1609.05347","kind":"arxiv","version":1}},"canonical_sha256":"9f3ca3da742b85f756b54005be063af9ec0320bed6a1d57e538ed17415e93cd9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9f3ca3da742b85f756b54005be063af9ec0320bed6a1d57e538ed17415e93cd9","first_computed_at":"2026-05-18T01:04:26.666955Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:04:26.666955Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"v8BZA6LyaPIphfXjMiN2/9QZrhRWP4KZo/YABFgzeRZzdufNVG9DIXQjlz0AAx7T2eaDxSOtUyWCpr0RBavHDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:04:26.667595Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.05347","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:262b74a64b3343c6f33c802c553e4a529eb2aec6f3a270b277ccde091461e461","sha256:655f91bb29fd6911800e8776e280d18507c51753f2c0ebf2e30f37f9586d58aa"],"state_sha256":"14a8510f54665691cd280f66d70487058d46255beae326ac9db1c76d81314037"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fjMiD4Tb0NA2Nne39B2ZlL9KAFwMbbwXWx0umJQLy43dVmVl9T1KjJ56XxaYtrK5jrpQlW8OSAx+marvmuESBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T02:07:48.245410Z","bundle_sha256":"4c40009ab90b48c57b005ccbe2bc3e35a7d7129717d7a700244e49ad96150236"}}