{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:WTSJUZ4TIX5T7WZQDTMVQOKBUO","short_pith_number":"pith:WTSJUZ4T","canonical_record":{"source":{"id":"2411.12917","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2024-11-19T23:05:43Z","cross_cats_sorted":[],"title_canon_sha256":"611e31e810be6e985cafb36f8f7a0c1afac0fae0ec0ee2488be480ef6d7838f2","abstract_canon_sha256":"ecef0f42f1db2dc4b989090b6a18bf648deb0e3b4540c67245dab36b8da45eda"},"schema_version":"1.0"},"canonical_sha256":"b4e49a679345fb3fdb301cd9583941a3bf7e4fc79db53a0b9c10c19bf1783ed7","source":{"kind":"arxiv","id":"2411.12917","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.12917","created_at":"2026-07-05T09:38:02Z"},{"alias_kind":"arxiv_version","alias_value":"2411.12917v1","created_at":"2026-07-05T09:38:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.12917","created_at":"2026-07-05T09:38:02Z"},{"alias_kind":"pith_short_12","alias_value":"WTSJUZ4TIX5T","created_at":"2026-07-05T09:38:02Z"},{"alias_kind":"pith_short_16","alias_value":"WTSJUZ4TIX5T7WZQ","created_at":"2026-07-05T09:38:02Z"},{"alias_kind":"pith_short_8","alias_value":"WTSJUZ4T","created_at":"2026-07-05T09:38:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:WTSJUZ4TIX5T7WZQDTMVQOKBUO","target":"record","payload":{"canonical_record":{"source":{"id":"2411.12917","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2024-11-19T23:05:43Z","cross_cats_sorted":[],"title_canon_sha256":"611e31e810be6e985cafb36f8f7a0c1afac0fae0ec0ee2488be480ef6d7838f2","abstract_canon_sha256":"ecef0f42f1db2dc4b989090b6a18bf648deb0e3b4540c67245dab36b8da45eda"},"schema_version":"1.0"},"canonical_sha256":"b4e49a679345fb3fdb301cd9583941a3bf7e4fc79db53a0b9c10c19bf1783ed7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:38:02.263618Z","signature_b64":"BA3JhXBbUSdR7JpQDz51IBcZV3rlplyiCZii5b9Oq6EZ1P2I4krMwElkI6iXiZbYx/AHVdoDGc+S10J5o1H6DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b4e49a679345fb3fdb301cd9583941a3bf7e4fc79db53a0b9c10c19bf1783ed7","last_reissued_at":"2026-07-05T09:38:02.263142Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:38:02.263142Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2411.12917","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-07-05T09:38:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"24NH7YjWvwb9gIqZ4fZnC2nNmKrgzEnLrggIDlVb+dLggqDuVvVVnhj1OTp01Sb7Q77EDDjFM51vylWtFyqlBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T20:55:31.454954Z"},"content_sha256":"576b76b5a88dc7df0be43d5acfb80ce332ab77d548e326a842949ec94641a8cd","schema_version":"1.0","event_id":"sha256:576b76b5a88dc7df0be43d5acfb80ce332ab77d548e326a842949ec94641a8cd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:WTSJUZ4TIX5T7WZQDTMVQOKBUO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Graphs with Bipartite Complement that Admit Two Distinct Eigenvalues","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Brendan Rooney, Michael Tait, Shahla Nasserasr, Shaun Fallat, Veronika Furst, Wayne Barrett","submitted_at":"2024-11-19T23:05:43Z","abstract_excerpt":"The parameter $q(G)$ of an $n$-vertex graph $G$ is the minimum number of distinct eigenvalues over the family of symmetric matrices described by $G$. We show that all $G$ with $e(\\overline{G}) = |E(\\overline{G})| \\leq \\lfloor n/2 \\rfloor -1$ have $q(G)=2$. We conjecture that any $G$ with $e(\\overline{G}) \\leq n-3$ satisfies $q(G) = 2$. We show that this conjecture is true if $\\overline{G}$ is bipartite and in other sporadic cases. Furthermore, we characterize $G$ with $\\overline{G}$ bipartite and $e(\\overline{G}) = n-2$ for which $q(G) > 2$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.12917","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2411.12917/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T09:38:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OQ5qurVaftkbXVFSBUStw0BXiXmt5qFV8Nq/8I8fQYMl6hhr+bkf/z8++qC60L+HWZIXg+UmNG/dlj4rerK2Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T20:55:31.455543Z"},"content_sha256":"cd9b80573dcb83edb75f009bbd7212ecbb4069014f77b6ec77bf35ec52e05cae","schema_version":"1.0","event_id":"sha256:cd9b80573dcb83edb75f009bbd7212ecbb4069014f77b6ec77bf35ec52e05cae"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WTSJUZ4TIX5T7WZQDTMVQOKBUO/bundle.json","state_url":"https://pith.science/pith/WTSJUZ4TIX5T7WZQDTMVQOKBUO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WTSJUZ4TIX5T7WZQDTMVQOKBUO/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-08-23T20:55:31Z","links":{"resolver":"https://pith.science/pith/WTSJUZ4TIX5T7WZQDTMVQOKBUO","bundle":"https://pith.science/pith/WTSJUZ4TIX5T7WZQDTMVQOKBUO/bundle.json","state":"https://pith.science/pith/WTSJUZ4TIX5T7WZQDTMVQOKBUO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WTSJUZ4TIX5T7WZQDTMVQOKBUO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:WTSJUZ4TIX5T7WZQDTMVQOKBUO","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":"ecef0f42f1db2dc4b989090b6a18bf648deb0e3b4540c67245dab36b8da45eda","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2024-11-19T23:05:43Z","title_canon_sha256":"611e31e810be6e985cafb36f8f7a0c1afac0fae0ec0ee2488be480ef6d7838f2"},"schema_version":"1.0","source":{"id":"2411.12917","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.12917","created_at":"2026-07-05T09:38:02Z"},{"alias_kind":"arxiv_version","alias_value":"2411.12917v1","created_at":"2026-07-05T09:38:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.12917","created_at":"2026-07-05T09:38:02Z"},{"alias_kind":"pith_short_12","alias_value":"WTSJUZ4TIX5T","created_at":"2026-07-05T09:38:02Z"},{"alias_kind":"pith_short_16","alias_value":"WTSJUZ4TIX5T7WZQ","created_at":"2026-07-05T09:38:02Z"},{"alias_kind":"pith_short_8","alias_value":"WTSJUZ4T","created_at":"2026-07-05T09:38:02Z"}],"graph_snapshots":[{"event_id":"sha256:cd9b80573dcb83edb75f009bbd7212ecbb4069014f77b6ec77bf35ec52e05cae","target":"graph","created_at":"2026-07-05T09:38:02Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2411.12917/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The parameter $q(G)$ of an $n$-vertex graph $G$ is the minimum number of distinct eigenvalues over the family of symmetric matrices described by $G$. We show that all $G$ with $e(\\overline{G}) = |E(\\overline{G})| \\leq \\lfloor n/2 \\rfloor -1$ have $q(G)=2$. We conjecture that any $G$ with $e(\\overline{G}) \\leq n-3$ satisfies $q(G) = 2$. We show that this conjecture is true if $\\overline{G}$ is bipartite and in other sporadic cases. Furthermore, we characterize $G$ with $\\overline{G}$ bipartite and $e(\\overline{G}) = n-2$ for which $q(G) > 2$.","authors_text":"Brendan Rooney, Michael Tait, Shahla Nasserasr, Shaun Fallat, Veronika Furst, Wayne Barrett","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2024-11-19T23:05:43Z","title":"Graphs with Bipartite Complement that Admit Two Distinct Eigenvalues"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.12917","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:576b76b5a88dc7df0be43d5acfb80ce332ab77d548e326a842949ec94641a8cd","target":"record","created_at":"2026-07-05T09:38:02Z","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":"ecef0f42f1db2dc4b989090b6a18bf648deb0e3b4540c67245dab36b8da45eda","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2024-11-19T23:05:43Z","title_canon_sha256":"611e31e810be6e985cafb36f8f7a0c1afac0fae0ec0ee2488be480ef6d7838f2"},"schema_version":"1.0","source":{"id":"2411.12917","kind":"arxiv","version":1}},"canonical_sha256":"b4e49a679345fb3fdb301cd9583941a3bf7e4fc79db53a0b9c10c19bf1783ed7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b4e49a679345fb3fdb301cd9583941a3bf7e4fc79db53a0b9c10c19bf1783ed7","first_computed_at":"2026-07-05T09:38:02.263142Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:38:02.263142Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BA3JhXBbUSdR7JpQDz51IBcZV3rlplyiCZii5b9Oq6EZ1P2I4krMwElkI6iXiZbYx/AHVdoDGc+S10J5o1H6DA==","signature_status":"signed_v1","signed_at":"2026-07-05T09:38:02.263618Z","signed_message":"canonical_sha256_bytes"},"source_id":"2411.12917","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:576b76b5a88dc7df0be43d5acfb80ce332ab77d548e326a842949ec94641a8cd","sha256:cd9b80573dcb83edb75f009bbd7212ecbb4069014f77b6ec77bf35ec52e05cae"],"state_sha256":"0816330663480020fc0478bed916a1b85aea53961f3e532745f4652763976dd6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QQIkyhtDuiL1UYnxxmxR7z26V0COu6I9yyCijI/DCbX2TzXusDtE8VKJ2E4SJ3bmMm7qZxaCrCJzxNMBgfoBDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-23T20:55:31.462338Z","bundle_sha256":"d781c1a1dbf83110341964101c09fbf38150abb91cb176811d2342e66a712a9f"}}