{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:QDXHC5HBIKSCYVCJTJ4DU3ISJM","short_pith_number":"pith:QDXHC5HB","schema_version":"1.0","canonical_sha256":"80ee7174e142a42c54499a783a6d124b39c1588e15d928877c4ea1385561dbe6","source":{"kind":"arxiv","id":"1112.2495","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1112.2495","created_at":"2026-05-18T01:02:57.399753+00:00"},{"alias_kind":"arxiv_version","alias_value":"1112.2495v2","created_at":"2026-05-18T01:02:57.399753+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.2495","created_at":"2026-05-18T01:02:57.399753+00:00"},{"alias_kind":"pith_short_12","alias_value":"QDXHC5HBIKSC","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_16","alias_value":"QDXHC5HBIKSCYVCJ","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_8","alias_value":"QDXHC5HB","created_at":"2026-05-18T12:26:39.201973+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QDXHC5HBIKSCYVCJTJ4DU3ISJM","json":"https://pith.science/pith/QDXHC5HBIKSCYVCJTJ4DU3ISJM.json","graph_json":"https://pith.science/api/pith-number/QDXHC5HBIKSCYVCJTJ4DU3ISJM/graph.json","events_json":"https://pith.science/api/pith-number/QDXHC5HBIKSCYVCJTJ4DU3ISJM/events.json","paper":"https://pith.science/paper/QDXHC5HB"},"agent_actions":{"view_html":"https://pith.science/pith/QDXHC5HBIKSCYVCJTJ4DU3ISJM","download_json":"https://pith.science/pith/QDXHC5HBIKSCYVCJTJ4DU3ISJM.json","view_paper":"https://pith.science/paper/QDXHC5HB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1112.2495&json=true","fetch_graph":"https://pith.science/api/pith-number/QDXHC5HBIKSCYVCJTJ4DU3ISJM/graph.json","fetch_events":"https://pith.science/api/pith-number/QDXHC5HBIKSCYVCJTJ4DU3ISJM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QDXHC5HBIKSCYVCJTJ4DU3ISJM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QDXHC5HBIKSCYVCJTJ4DU3ISJM/action/storage_attestation","attest_author":"https://pith.science/pith/QDXHC5HBIKSCYVCJTJ4DU3ISJM/action/author_attestation","sign_citation":"https://pith.science/pith/QDXHC5HBIKSCYVCJTJ4DU3ISJM/action/citation_signature","submit_replication":"https://pith.science/pith/QDXHC5HBIKSCYVCJTJ4DU3ISJM/action/replication_record"}},"created_at":"2026-05-18T01:02:57.399753+00:00","updated_at":"2026-05-18T01:02:57.399753+00:00"}