{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:DQPQZK5MZMERCOUF2OQXDNOKEY","short_pith_number":"pith:DQPQZK5M","canonical_record":{"source":{"id":"1808.10820","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-08-31T15:53:57Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"b73060aef5e06da21b3c6639375ee4f6f0151f8b9541392a85fc51ba2dcd61e4","abstract_canon_sha256":"a03ba5e7aea347319236fa8a9c28488bfafbbc24f695c1b5741b7f8fd8f0ab0f"},"schema_version":"1.0"},"canonical_sha256":"1c1f0cabaccb09113a85d3a171b5ca260807ca1200b1cab0bcf4b536d1a4b191","source":{"kind":"arxiv","id":"1808.10820","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.10820","created_at":"2026-05-17T23:58:55Z"},{"alias_kind":"arxiv_version","alias_value":"1808.10820v4","created_at":"2026-05-17T23:58:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.10820","created_at":"2026-05-17T23:58:55Z"},{"alias_kind":"pith_short_12","alias_value":"DQPQZK5MZMER","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"DQPQZK5MZMERCOUF","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"DQPQZK5M","created_at":"2026-05-18T12:32:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:DQPQZK5MZMERCOUF2OQXDNOKEY","target":"record","payload":{"canonical_record":{"source":{"id":"1808.10820","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-08-31T15:53:57Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"b73060aef5e06da21b3c6639375ee4f6f0151f8b9541392a85fc51ba2dcd61e4","abstract_canon_sha256":"a03ba5e7aea347319236fa8a9c28488bfafbbc24f695c1b5741b7f8fd8f0ab0f"},"schema_version":"1.0"},"canonical_sha256":"1c1f0cabaccb09113a85d3a171b5ca260807ca1200b1cab0bcf4b536d1a4b191","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:55.931350Z","signature_b64":"WXP+1iTvCJrZbC4WawT30Ik8L+WWmfTU/D+k83KYOV90CUyRmNrCbmzQ7OkisOgSDOd/Ebub0WNRWrMk/7z3DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1c1f0cabaccb09113a85d3a171b5ca260807ca1200b1cab0bcf4b536d1a4b191","last_reissued_at":"2026-05-17T23:58:55.930810Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:55.930810Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.10820","source_version":4,"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-17T23:58:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sai4QdFG4HZFz4EW++/tv8eRH6R/je+X69qD6cz5uwkhUXEyzG+sx+1bRDx9xqGRTQT46l2GiD6mk6883crWAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T20:43:07.769871Z"},"content_sha256":"2b8e39338d180af10b2226820cb477ad4b0ced89aa6012a8be7019de0239990e","schema_version":"1.0","event_id":"sha256:2b8e39338d180af10b2226820cb477ad4b0ced89aa6012a8be7019de0239990e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:DQPQZK5MZMERCOUF2OQXDNOKEY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An inertial upper bound for the quantum independence number of a graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"math.CO","authors_text":"Clive Elphick, Pawel Wocjan","submitted_at":"2018-08-31T15:53:57Z","abstract_excerpt":"A well known upper bound for the independence number $\\alpha(G)$ of a graph $G$, is that \\[ \\alpha(G) \\le n^0 + \\min\\{n^+ , n^-\\}, \\] where $(n^+, n^0, n^-)$ is the inertia of $G$. We prove that this bound is also an upper bound for the quantum independence number $\\alpha_q$(G), where $\\alpha_q(G) \\ge \\alpha(G)$. We identify numerous graphs for which $\\alpha(G) = \\alpha_q(G)$ and demonstrate that there are graphs for which the above bound is not exact with any Hermitian weight matrix, for $\\alpha(G)$ and $\\alpha_q(G)$. This result complements results by the authors that many spectral lower bou"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.10820","kind":"arxiv","version":4},"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-17T23:58:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eLkcz2FLP/69S4a/pzdLfetzqHNe+8Zdlby7HLF8VnVYFDpVosFJdILMDRugz6F83itgClkGo8fBx8j+67UeDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T20:43:07.770559Z"},"content_sha256":"a3069be8d95eae0821038fd3c86d84b4c14ee940205f7b60f79c4e244fea7c3a","schema_version":"1.0","event_id":"sha256:a3069be8d95eae0821038fd3c86d84b4c14ee940205f7b60f79c4e244fea7c3a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DQPQZK5MZMERCOUF2OQXDNOKEY/bundle.json","state_url":"https://pith.science/pith/DQPQZK5MZMERCOUF2OQXDNOKEY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DQPQZK5MZMERCOUF2OQXDNOKEY/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-05-27T20:43:07Z","links":{"resolver":"https://pith.science/pith/DQPQZK5MZMERCOUF2OQXDNOKEY","bundle":"https://pith.science/pith/DQPQZK5MZMERCOUF2OQXDNOKEY/bundle.json","state":"https://pith.science/pith/DQPQZK5MZMERCOUF2OQXDNOKEY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DQPQZK5MZMERCOUF2OQXDNOKEY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:DQPQZK5MZMERCOUF2OQXDNOKEY","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":"a03ba5e7aea347319236fa8a9c28488bfafbbc24f695c1b5741b7f8fd8f0ab0f","cross_cats_sorted":["quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-08-31T15:53:57Z","title_canon_sha256":"b73060aef5e06da21b3c6639375ee4f6f0151f8b9541392a85fc51ba2dcd61e4"},"schema_version":"1.0","source":{"id":"1808.10820","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.10820","created_at":"2026-05-17T23:58:55Z"},{"alias_kind":"arxiv_version","alias_value":"1808.10820v4","created_at":"2026-05-17T23:58:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.10820","created_at":"2026-05-17T23:58:55Z"},{"alias_kind":"pith_short_12","alias_value":"DQPQZK5MZMER","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"DQPQZK5MZMERCOUF","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"DQPQZK5M","created_at":"2026-05-18T12:32:19Z"}],"graph_snapshots":[{"event_id":"sha256:a3069be8d95eae0821038fd3c86d84b4c14ee940205f7b60f79c4e244fea7c3a","target":"graph","created_at":"2026-05-17T23:58:55Z","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 well known upper bound for the independence number $\\alpha(G)$ of a graph $G$, is that \\[ \\alpha(G) \\le n^0 + \\min\\{n^+ , n^-\\}, \\] where $(n^+, n^0, n^-)$ is the inertia of $G$. We prove that this bound is also an upper bound for the quantum independence number $\\alpha_q$(G), where $\\alpha_q(G) \\ge \\alpha(G)$. We identify numerous graphs for which $\\alpha(G) = \\alpha_q(G)$ and demonstrate that there are graphs for which the above bound is not exact with any Hermitian weight matrix, for $\\alpha(G)$ and $\\alpha_q(G)$. This result complements results by the authors that many spectral lower bou","authors_text":"Clive Elphick, Pawel Wocjan","cross_cats":["quant-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-08-31T15:53:57Z","title":"An inertial upper bound for the quantum independence number of a graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.10820","kind":"arxiv","version":4},"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:2b8e39338d180af10b2226820cb477ad4b0ced89aa6012a8be7019de0239990e","target":"record","created_at":"2026-05-17T23:58:55Z","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":"a03ba5e7aea347319236fa8a9c28488bfafbbc24f695c1b5741b7f8fd8f0ab0f","cross_cats_sorted":["quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-08-31T15:53:57Z","title_canon_sha256":"b73060aef5e06da21b3c6639375ee4f6f0151f8b9541392a85fc51ba2dcd61e4"},"schema_version":"1.0","source":{"id":"1808.10820","kind":"arxiv","version":4}},"canonical_sha256":"1c1f0cabaccb09113a85d3a171b5ca260807ca1200b1cab0bcf4b536d1a4b191","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1c1f0cabaccb09113a85d3a171b5ca260807ca1200b1cab0bcf4b536d1a4b191","first_computed_at":"2026-05-17T23:58:55.930810Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:58:55.930810Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WXP+1iTvCJrZbC4WawT30Ik8L+WWmfTU/D+k83KYOV90CUyRmNrCbmzQ7OkisOgSDOd/Ebub0WNRWrMk/7z3DA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:58:55.931350Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.10820","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2b8e39338d180af10b2226820cb477ad4b0ced89aa6012a8be7019de0239990e","sha256:a3069be8d95eae0821038fd3c86d84b4c14ee940205f7b60f79c4e244fea7c3a"],"state_sha256":"6499450b985d573d19ff51d6772eee7590a989c8a27435eb5879e36d34dc6c94"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OwDE7ARE3VRskl3f6EhywtGpZiecoVVbGNH++oS4TRRPILd+gGV/H6WMzCSbQAslh95MdxGOo5EV0C2WjQqdBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T20:43:07.773660Z","bundle_sha256":"79235bbc426370211811788a78795a4c0f5cfa369e7a57f33317036c022129f5"}}