{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:TQHFOCRT5N66J2XLJP4DNYLJCX","short_pith_number":"pith:TQHFOCRT","canonical_record":{"source":{"id":"1204.4564","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-04-20T08:58:46Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"721ee64e97c27adc35b0ce6ed3766824d787bc21aead52019639db97d4d8d6bd","abstract_canon_sha256":"4cc58c0724991e40c81ca67d4ebcd439e6a1959d7d3c69bc729e71c4111fe06b"},"schema_version":"1.0"},"canonical_sha256":"9c0e570a33eb7de4eaeb4bf836e16915f000566e42ac74401a361e9af45bbdd0","source":{"kind":"arxiv","id":"1204.4564","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.4564","created_at":"2026-05-18T01:02:57Z"},{"alias_kind":"arxiv_version","alias_value":"1204.4564v1","created_at":"2026-05-18T01:02:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.4564","created_at":"2026-05-18T01:02:57Z"},{"alias_kind":"pith_short_12","alias_value":"TQHFOCRT5N66","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_16","alias_value":"TQHFOCRT5N66J2XL","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_8","alias_value":"TQHFOCRT","created_at":"2026-05-18T12:27:23Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:TQHFOCRT5N66J2XLJP4DNYLJCX","target":"record","payload":{"canonical_record":{"source":{"id":"1204.4564","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-04-20T08:58:46Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"721ee64e97c27adc35b0ce6ed3766824d787bc21aead52019639db97d4d8d6bd","abstract_canon_sha256":"4cc58c0724991e40c81ca67d4ebcd439e6a1959d7d3c69bc729e71c4111fe06b"},"schema_version":"1.0"},"canonical_sha256":"9c0e570a33eb7de4eaeb4bf836e16915f000566e42ac74401a361e9af45bbdd0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:02:57.373493Z","signature_b64":"MjE27aZglGid5aspQRUGBxztX8vlN3abALaWgnz6luLYhW9T9nARUJjWZM5WTH1zZ8z1J7MoZibkG6tJZbPnDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9c0e570a33eb7de4eaeb4bf836e16915f000566e42ac74401a361e9af45bbdd0","last_reissued_at":"2026-05-18T01:02:57.372927Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:02:57.372927Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1204.4564","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:02:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4ZXGFRvr+DVZRS+IaFxtlSlo7RAyQTppp/2OBIezkS+0tpSzYHR5m6a2sAYPs9FVwOTfQtscnUOYAiuhHRPnAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T21:21:27.773140Z"},"content_sha256":"091fb8ed54212707b4d7469b2e73c2a849c1a51459ee2d798208eee766b9976a","schema_version":"1.0","event_id":"sha256:091fb8ed54212707b4d7469b2e73c2a849c1a51459ee2d798208eee766b9976a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:TQHFOCRT5N66J2XLJP4DNYLJCX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Minimum Degree up to Local Complementation: Bounds and Complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cs.CC","authors_text":"J\\'er\\^ome Javelle, Mehdi Mhalla, Simon Perdrix","submitted_at":"2012-04-20T08:58:46Z","abstract_excerpt":"The local minimum degree of a graph is the minimum degree reached by means of a series of local complementations. In this paper, we investigate on this quantity which plays an important role in quantum computation and quantum error correcting codes. First, we show that the local minimum degree of the Paley graph of order p is greater than sqrt{p} - 3/2, which is, up to our knowledge, the highest known bound on an explicit family of graphs. Probabilistic methods allows us to derive the existence of an infinite number of graphs whose local minimum degree is linear in their order with constant 0."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.4564","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:02:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8FczkI13/pe5Dbmghy5jgm6+rWoQOuZ/GCV6ykFbsxG2DU7yItOVz48H1hesHottdzQSVc1jqHoDP+6I0XxiDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T21:21:27.773850Z"},"content_sha256":"85825d980acae43c94816f8fc4b4d373020c39bc10be7fa58df9c1f2d26ce523","schema_version":"1.0","event_id":"sha256:85825d980acae43c94816f8fc4b4d373020c39bc10be7fa58df9c1f2d26ce523"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TQHFOCRT5N66J2XLJP4DNYLJCX/bundle.json","state_url":"https://pith.science/pith/TQHFOCRT5N66J2XLJP4DNYLJCX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TQHFOCRT5N66J2XLJP4DNYLJCX/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-26T21:21:27Z","links":{"resolver":"https://pith.science/pith/TQHFOCRT5N66J2XLJP4DNYLJCX","bundle":"https://pith.science/pith/TQHFOCRT5N66J2XLJP4DNYLJCX/bundle.json","state":"https://pith.science/pith/TQHFOCRT5N66J2XLJP4DNYLJCX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TQHFOCRT5N66J2XLJP4DNYLJCX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:TQHFOCRT5N66J2XLJP4DNYLJCX","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":"4cc58c0724991e40c81ca67d4ebcd439e6a1959d7d3c69bc729e71c4111fe06b","cross_cats_sorted":["quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-04-20T08:58:46Z","title_canon_sha256":"721ee64e97c27adc35b0ce6ed3766824d787bc21aead52019639db97d4d8d6bd"},"schema_version":"1.0","source":{"id":"1204.4564","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.4564","created_at":"2026-05-18T01:02:57Z"},{"alias_kind":"arxiv_version","alias_value":"1204.4564v1","created_at":"2026-05-18T01:02:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.4564","created_at":"2026-05-18T01:02:57Z"},{"alias_kind":"pith_short_12","alias_value":"TQHFOCRT5N66","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_16","alias_value":"TQHFOCRT5N66J2XL","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_8","alias_value":"TQHFOCRT","created_at":"2026-05-18T12:27:23Z"}],"graph_snapshots":[{"event_id":"sha256:85825d980acae43c94816f8fc4b4d373020c39bc10be7fa58df9c1f2d26ce523","target":"graph","created_at":"2026-05-18T01:02:57Z","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":"The local minimum degree of a graph is the minimum degree reached by means of a series of local complementations. In this paper, we investigate on this quantity which plays an important role in quantum computation and quantum error correcting codes. First, we show that the local minimum degree of the Paley graph of order p is greater than sqrt{p} - 3/2, which is, up to our knowledge, the highest known bound on an explicit family of graphs. Probabilistic methods allows us to derive the existence of an infinite number of graphs whose local minimum degree is linear in their order with constant 0.","authors_text":"J\\'er\\^ome Javelle, Mehdi Mhalla, Simon Perdrix","cross_cats":["quant-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-04-20T08:58:46Z","title":"On the Minimum Degree up to Local Complementation: Bounds and Complexity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.4564","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:091fb8ed54212707b4d7469b2e73c2a849c1a51459ee2d798208eee766b9976a","target":"record","created_at":"2026-05-18T01:02:57Z","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":"4cc58c0724991e40c81ca67d4ebcd439e6a1959d7d3c69bc729e71c4111fe06b","cross_cats_sorted":["quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-04-20T08:58:46Z","title_canon_sha256":"721ee64e97c27adc35b0ce6ed3766824d787bc21aead52019639db97d4d8d6bd"},"schema_version":"1.0","source":{"id":"1204.4564","kind":"arxiv","version":1}},"canonical_sha256":"9c0e570a33eb7de4eaeb4bf836e16915f000566e42ac74401a361e9af45bbdd0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9c0e570a33eb7de4eaeb4bf836e16915f000566e42ac74401a361e9af45bbdd0","first_computed_at":"2026-05-18T01:02:57.372927Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:02:57.372927Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MjE27aZglGid5aspQRUGBxztX8vlN3abALaWgnz6luLYhW9T9nARUJjWZM5WTH1zZ8z1J7MoZibkG6tJZbPnDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:02:57.373493Z","signed_message":"canonical_sha256_bytes"},"source_id":"1204.4564","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:091fb8ed54212707b4d7469b2e73c2a849c1a51459ee2d798208eee766b9976a","sha256:85825d980acae43c94816f8fc4b4d373020c39bc10be7fa58df9c1f2d26ce523"],"state_sha256":"9ff72996e8131357ab65b01407ced96654d617ecc065a4082a612abebfbb3e62"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aOrKnbsO/udf41vHAsLnNHvT1ej7S9EYWJNx/+z1HJuvZi7L8DvuwnXZFSZ7zW9zXuY8wAMy+tv2MugUelDIBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T21:21:27.776946Z","bundle_sha256":"ef7b0023eb9e0be69297af73be8be01c7f6a039857135079beca5264736279b4"}}