{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:QDXHC5HBIKSCYVCJTJ4DU3ISJM","short_pith_number":"pith:QDXHC5HB","canonical_record":{"source":{"id":"1112.2495","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-12-12T10:16:19Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"a0af7d0f5dc97dd20afc75c2d7e5bbadcaf320d4a3eca52ac68125f338b0fda6","abstract_canon_sha256":"3c2eee6efeb8d48d1d9031a54d866a1a1a86d2406825824d455755d11f345a5d"},"schema_version":"1.0"},"canonical_sha256":"80ee7174e142a42c54499a783a6d124b39c1588e15d928877c4ea1385561dbe6","source":{"kind":"arxiv","id":"1112.2495","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.2495","created_at":"2026-05-18T01:02:57Z"},{"alias_kind":"arxiv_version","alias_value":"1112.2495v2","created_at":"2026-05-18T01:02:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.2495","created_at":"2026-05-18T01:02:57Z"},{"alias_kind":"pith_short_12","alias_value":"QDXHC5HBIKSC","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"QDXHC5HBIKSCYVCJ","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"QDXHC5HB","created_at":"2026-05-18T12:26:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:QDXHC5HBIKSCYVCJTJ4DU3ISJM","target":"record","payload":{"canonical_record":{"source":{"id":"1112.2495","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-12-12T10:16:19Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"a0af7d0f5dc97dd20afc75c2d7e5bbadcaf320d4a3eca52ac68125f338b0fda6","abstract_canon_sha256":"3c2eee6efeb8d48d1d9031a54d866a1a1a86d2406825824d455755d11f345a5d"},"schema_version":"1.0"},"canonical_sha256":"80ee7174e142a42c54499a783a6d124b39c1588e15d928877c4ea1385561dbe6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:02:57.400437Z","signature_b64":"c35l7vlKECMPMFwlH/JV6EfBy8hw/Lsrf+O5U0qIrmXabF0mInnAGpR4PHcECxbSByTcX3yvks01Lkz1JCYkBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"80ee7174e142a42c54499a783a6d124b39c1588e15d928877c4ea1385561dbe6","last_reissued_at":"2026-05-18T01:02:57.399639Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:02:57.399639Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1112.2495","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-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":"y4JBLrgyzXgnyLuu1e3VAOUH671mV/9JP9gjyeNFuX20rTCC7OWTl9/9cvpd/gNTKp7xqdeHtkHafmwtH9OBBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T21:16:05.250212Z"},"content_sha256":"c36cd87e430ef7274695785ede0457ee277ff1c19059b5ec02e935969a14f6ab","schema_version":"1.0","event_id":"sha256:c36cd87e430ef7274695785ede0457ee277ff1c19059b5ec02e935969a14f6ab"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:QDXHC5HBIKSCYVCJTJ4DU3ISJM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Weak Odd Domination and Graph-based Quantum Secret Sharing","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, Sylvain Gravier","submitted_at":"2011-12-12T10:16:19Z","abstract_excerpt":"A weak odd dominated (WOD) set in a graph is a subset B of vertices for which there exists a distinct set of vertices C such that every vertex in B has an odd number of neighbors in C. We point out the connections of weak odd domination with odd domination, [sigma,rho]-domination, and perfect codes. We introduce bounds on \\kappa(G), the maximum size of WOD sets of a graph G, and on \\kappa'(G), the minimum size of non WOD sets of G. Moreover, we prove that the corresponding decision problems are NP-complete. The study of weak odd domination is mainly motivated by the design of graph-based quant"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.2495","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-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":"7ga3UzGdUE0/bZHnDdP9AujUbiotE02FlJeb10QO2S5xljiYOHVv7FBmIl6xmkhVPiuCsECTiMSoVF4HIhw6Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T21:16:05.250653Z"},"content_sha256":"4cf2d997e40882b61daca1fa5db72346fb264b7420389cd0d72871c8929b4336","schema_version":"1.0","event_id":"sha256:4cf2d997e40882b61daca1fa5db72346fb264b7420389cd0d72871c8929b4336"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QDXHC5HBIKSCYVCJTJ4DU3ISJM/bundle.json","state_url":"https://pith.science/pith/QDXHC5HBIKSCYVCJTJ4DU3ISJM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QDXHC5HBIKSCYVCJTJ4DU3ISJM/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:16:05Z","links":{"resolver":"https://pith.science/pith/QDXHC5HBIKSCYVCJTJ4DU3ISJM","bundle":"https://pith.science/pith/QDXHC5HBIKSCYVCJTJ4DU3ISJM/bundle.json","state":"https://pith.science/pith/QDXHC5HBIKSCYVCJTJ4DU3ISJM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QDXHC5HBIKSCYVCJTJ4DU3ISJM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:QDXHC5HBIKSCYVCJTJ4DU3ISJM","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":"3c2eee6efeb8d48d1d9031a54d866a1a1a86d2406825824d455755d11f345a5d","cross_cats_sorted":["quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-12-12T10:16:19Z","title_canon_sha256":"a0af7d0f5dc97dd20afc75c2d7e5bbadcaf320d4a3eca52ac68125f338b0fda6"},"schema_version":"1.0","source":{"id":"1112.2495","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.2495","created_at":"2026-05-18T01:02:57Z"},{"alias_kind":"arxiv_version","alias_value":"1112.2495v2","created_at":"2026-05-18T01:02:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.2495","created_at":"2026-05-18T01:02:57Z"},{"alias_kind":"pith_short_12","alias_value":"QDXHC5HBIKSC","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"QDXHC5HBIKSCYVCJ","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"QDXHC5HB","created_at":"2026-05-18T12:26:39Z"}],"graph_snapshots":[{"event_id":"sha256:4cf2d997e40882b61daca1fa5db72346fb264b7420389cd0d72871c8929b4336","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":"A weak odd dominated (WOD) set in a graph is a subset B of vertices for which there exists a distinct set of vertices C such that every vertex in B has an odd number of neighbors in C. We point out the connections of weak odd domination with odd domination, [sigma,rho]-domination, and perfect codes. We introduce bounds on \\kappa(G), the maximum size of WOD sets of a graph G, and on \\kappa'(G), the minimum size of non WOD sets of G. Moreover, we prove that the corresponding decision problems are NP-complete. The study of weak odd domination is mainly motivated by the design of graph-based quant","authors_text":"J\\'er\\^ome Javelle, Mehdi Mhalla, Simon Perdrix, Sylvain Gravier","cross_cats":["quant-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-12-12T10:16:19Z","title":"On Weak Odd Domination and Graph-based Quantum Secret Sharing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.2495","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:c36cd87e430ef7274695785ede0457ee277ff1c19059b5ec02e935969a14f6ab","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":"3c2eee6efeb8d48d1d9031a54d866a1a1a86d2406825824d455755d11f345a5d","cross_cats_sorted":["quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-12-12T10:16:19Z","title_canon_sha256":"a0af7d0f5dc97dd20afc75c2d7e5bbadcaf320d4a3eca52ac68125f338b0fda6"},"schema_version":"1.0","source":{"id":"1112.2495","kind":"arxiv","version":2}},"canonical_sha256":"80ee7174e142a42c54499a783a6d124b39c1588e15d928877c4ea1385561dbe6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"80ee7174e142a42c54499a783a6d124b39c1588e15d928877c4ea1385561dbe6","first_computed_at":"2026-05-18T01:02:57.399639Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:02:57.399639Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"c35l7vlKECMPMFwlH/JV6EfBy8hw/Lsrf+O5U0qIrmXabF0mInnAGpR4PHcECxbSByTcX3yvks01Lkz1JCYkBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:02:57.400437Z","signed_message":"canonical_sha256_bytes"},"source_id":"1112.2495","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c36cd87e430ef7274695785ede0457ee277ff1c19059b5ec02e935969a14f6ab","sha256:4cf2d997e40882b61daca1fa5db72346fb264b7420389cd0d72871c8929b4336"],"state_sha256":"d28d877d96348e6f4478eadc95296a000ff8e1ff1a392c5d489ac7464bb9e3d5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+5g6ToV6+DqQpr2kFpmMhA3SjEYo0pC16jQoo9RbfrNWqdI7euz1NJvTZA2Jw7R4prTKGu7GFkGExD4IoX+RDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T21:16:05.253037Z","bundle_sha256":"8c53676ffe2021cd9e92d1a6d66852b5b9748e44978236bddc81fcdc51c7205a"}}