{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:XLWLLDTVNRUAK6KLLV6EIMIDJA","short_pith_number":"pith:XLWLLDTV","canonical_record":{"source":{"id":"1712.01749","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-05T16:40:32Z","cross_cats_sorted":[],"title_canon_sha256":"9b57064ad9a8036e774fb0c1c8b6fe4e4022d8457a6226a43abd4a6ba45ecb2f","abstract_canon_sha256":"67822d3175ec9dff633445f0a3c52f559614e8e121f3fd10baa033a5ec371834"},"schema_version":"1.0"},"canonical_sha256":"baecb58e756c6805794b5d7c443103482a77d9bc4ae346c19d5b725dadd6efe0","source":{"kind":"arxiv","id":"1712.01749","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.01749","created_at":"2026-05-18T00:22:15Z"},{"alias_kind":"arxiv_version","alias_value":"1712.01749v2","created_at":"2026-05-18T00:22:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.01749","created_at":"2026-05-18T00:22:15Z"},{"alias_kind":"pith_short_12","alias_value":"XLWLLDTVNRUA","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"XLWLLDTVNRUAK6KL","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"XLWLLDTV","created_at":"2026-05-18T12:31:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:XLWLLDTVNRUAK6KLLV6EIMIDJA","target":"record","payload":{"canonical_record":{"source":{"id":"1712.01749","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-05T16:40:32Z","cross_cats_sorted":[],"title_canon_sha256":"9b57064ad9a8036e774fb0c1c8b6fe4e4022d8457a6226a43abd4a6ba45ecb2f","abstract_canon_sha256":"67822d3175ec9dff633445f0a3c52f559614e8e121f3fd10baa033a5ec371834"},"schema_version":"1.0"},"canonical_sha256":"baecb58e756c6805794b5d7c443103482a77d9bc4ae346c19d5b725dadd6efe0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:15.780836Z","signature_b64":"QY4PUCIh+vws0EEas6TXyczOguuZG596XHuOLEnu/9hHrObAbLfzKQ817Ew5MJefTSxco+0Qe5GV9J+qmNmCDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"baecb58e756c6805794b5d7c443103482a77d9bc4ae346c19d5b725dadd6efe0","last_reissued_at":"2026-05-18T00:22:15.780145Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:15.780145Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.01749","source_version":2,"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:22:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lNZ570LLQoNZW2ByK1/OSTop8WtPSiJSe0AV9t/8RCsnkr/EqBsTcyaINWhFu51L+eeI7J3DmJgLXUq1iiWPBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T09:36:34.458525Z"},"content_sha256":"639c6954fee5e740e207afd6a78d503c829adf72995c78ab73a643b6360164af","schema_version":"1.0","event_id":"sha256:639c6954fee5e740e207afd6a78d503c829adf72995c78ab73a643b6360164af"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:XLWLLDTVNRUAK6KLLV6EIMIDJA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Spectral characterization of mixed extensions of small graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Willem H. Haemers","submitted_at":"2017-12-05T16:40:32Z","abstract_excerpt":"A mixed extension of a graph $G$ is a graph $H$ obtained from $G$ by replacing each vertex of $G$ by a clique or a coclique, where vertices of $H$ coming from different vertices of $G$ are adjacent if and only if the original vertices are adjacent in $G$. If $G$ has no more than three vertices, $H$ has all but at most three adjacency eigenvalues equal to $0$ or $-1$. In this paper we consider the converse problem, and determine the class $\\cal G$ of all graphs with at most three eigenvalues unequal to $0$ and $-1$. Ignoring isolated vertices, we find that $\\cal G$ consists of all mixed extensi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.01749","kind":"arxiv","version":2},"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:22:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CLoSc1Icclu9fMmYDzbQqYJxbJoi0rymuuLMsuD9WHfKs6N9wEUox6eruQVb/kTO615juqtEUAu6GUwacS76DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T09:36:34.458869Z"},"content_sha256":"a6af2c5891facd2ab7092ca12377486cca5861bb1346251bbf1fe9392305a7c8","schema_version":"1.0","event_id":"sha256:a6af2c5891facd2ab7092ca12377486cca5861bb1346251bbf1fe9392305a7c8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XLWLLDTVNRUAK6KLLV6EIMIDJA/bundle.json","state_url":"https://pith.science/pith/XLWLLDTVNRUAK6KLLV6EIMIDJA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XLWLLDTVNRUAK6KLLV6EIMIDJA/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-01T09:36:34Z","links":{"resolver":"https://pith.science/pith/XLWLLDTVNRUAK6KLLV6EIMIDJA","bundle":"https://pith.science/pith/XLWLLDTVNRUAK6KLLV6EIMIDJA/bundle.json","state":"https://pith.science/pith/XLWLLDTVNRUAK6KLLV6EIMIDJA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XLWLLDTVNRUAK6KLLV6EIMIDJA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:XLWLLDTVNRUAK6KLLV6EIMIDJA","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":"67822d3175ec9dff633445f0a3c52f559614e8e121f3fd10baa033a5ec371834","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-05T16:40:32Z","title_canon_sha256":"9b57064ad9a8036e774fb0c1c8b6fe4e4022d8457a6226a43abd4a6ba45ecb2f"},"schema_version":"1.0","source":{"id":"1712.01749","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.01749","created_at":"2026-05-18T00:22:15Z"},{"alias_kind":"arxiv_version","alias_value":"1712.01749v2","created_at":"2026-05-18T00:22:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.01749","created_at":"2026-05-18T00:22:15Z"},{"alias_kind":"pith_short_12","alias_value":"XLWLLDTVNRUA","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"XLWLLDTVNRUAK6KL","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"XLWLLDTV","created_at":"2026-05-18T12:31:56Z"}],"graph_snapshots":[{"event_id":"sha256:a6af2c5891facd2ab7092ca12377486cca5861bb1346251bbf1fe9392305a7c8","target":"graph","created_at":"2026-05-18T00:22:15Z","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":"A mixed extension of a graph $G$ is a graph $H$ obtained from $G$ by replacing each vertex of $G$ by a clique or a coclique, where vertices of $H$ coming from different vertices of $G$ are adjacent if and only if the original vertices are adjacent in $G$. If $G$ has no more than three vertices, $H$ has all but at most three adjacency eigenvalues equal to $0$ or $-1$. In this paper we consider the converse problem, and determine the class $\\cal G$ of all graphs with at most three eigenvalues unequal to $0$ and $-1$. Ignoring isolated vertices, we find that $\\cal G$ consists of all mixed extensi","authors_text":"Willem H. Haemers","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-05T16:40:32Z","title":"Spectral characterization of mixed extensions of small graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.01749","kind":"arxiv","version":2},"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:639c6954fee5e740e207afd6a78d503c829adf72995c78ab73a643b6360164af","target":"record","created_at":"2026-05-18T00:22:15Z","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":"67822d3175ec9dff633445f0a3c52f559614e8e121f3fd10baa033a5ec371834","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-05T16:40:32Z","title_canon_sha256":"9b57064ad9a8036e774fb0c1c8b6fe4e4022d8457a6226a43abd4a6ba45ecb2f"},"schema_version":"1.0","source":{"id":"1712.01749","kind":"arxiv","version":2}},"canonical_sha256":"baecb58e756c6805794b5d7c443103482a77d9bc4ae346c19d5b725dadd6efe0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"baecb58e756c6805794b5d7c443103482a77d9bc4ae346c19d5b725dadd6efe0","first_computed_at":"2026-05-18T00:22:15.780145Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:22:15.780145Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QY4PUCIh+vws0EEas6TXyczOguuZG596XHuOLEnu/9hHrObAbLfzKQ817Ew5MJefTSxco+0Qe5GV9J+qmNmCDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:22:15.780836Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.01749","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:639c6954fee5e740e207afd6a78d503c829adf72995c78ab73a643b6360164af","sha256:a6af2c5891facd2ab7092ca12377486cca5861bb1346251bbf1fe9392305a7c8"],"state_sha256":"a987145b079b793eddc0562b3d9cd22dcb96bbde36ad2916b57675ce68ff6a3f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XdBE/ritTTVB/dvsFNDxYO4vTWltmisOMeL/9sw/bF22I3aXVXTEsbW4QQuIihKhccRTx6mOqU1uIQ8cqV64AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T09:36:34.460845Z","bundle_sha256":"a522a504bf8d4d85ec6ceae36b456363cc622c7fc6fc953f216041a235507c86"}}