{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:TWYU6CILPKBCR64HLOAHBPVUXU","short_pith_number":"pith:TWYU6CIL","schema_version":"1.0","canonical_sha256":"9db14f090b7a8228fb875b8070beb4bd0be9139d4871284c35fa6d0ca2c089dc","source":{"kind":"arxiv","id":"1503.04048","version":1},"attestation_state":"computed","paper":{"title":"Secure Domination in Digraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Karam Ebadi, Martin Manrique, Morteza Ebrahimi","submitted_at":"2015-03-13T13:06:08Z","abstract_excerpt":"Given a graph G = (V,E), a subset S of V is dominating if for every v in V - S there exists u in S such that uv is in E. A dominating subset S of V is secure if for every v in V - S there exists u in S such that (S - {u}) U {v} is dominating. In this work we extend the concept of secure dominating set to digraphs in four different ways, all of them with interesting applications, and prove some results regarding each of them."},"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":"1503.04048","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-03-13T13:06:08Z","cross_cats_sorted":[],"title_canon_sha256":"afaba75b9fee28b5e17f22d5cf9c59fcf7bee85297750ba1e382161d43a95517","abstract_canon_sha256":"fa1703fb8539ff7f3a8d291bd241e08a134a3e19a406cac27fb3d4a50804246d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:23:57.251393Z","signature_b64":"bNzlfOdeCKINUYJ97YP5bQ3zR65LEgko2EQuNBdrve+yuev05c6YZRxvnxhu47XE/PytUOB5BI9mESVPnAD4BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9db14f090b7a8228fb875b8070beb4bd0be9139d4871284c35fa6d0ca2c089dc","last_reissued_at":"2026-05-18T02:23:57.250686Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:23:57.250686Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Secure Domination in Digraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Karam Ebadi, Martin Manrique, Morteza Ebrahimi","submitted_at":"2015-03-13T13:06:08Z","abstract_excerpt":"Given a graph G = (V,E), a subset S of V is dominating if for every v in V - S there exists u in S such that uv is in E. A dominating subset S of V is secure if for every v in V - S there exists u in S such that (S - {u}) U {v} is dominating. In this work we extend the concept of secure dominating set to digraphs in four different ways, all of them with interesting applications, and prove some results regarding each of them."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.04048","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1503.04048","created_at":"2026-05-18T02:23:57.250805+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.04048v1","created_at":"2026-05-18T02:23:57.250805+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.04048","created_at":"2026-05-18T02:23:57.250805+00:00"},{"alias_kind":"pith_short_12","alias_value":"TWYU6CILPKBC","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_16","alias_value":"TWYU6CILPKBCR64H","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_8","alias_value":"TWYU6CIL","created_at":"2026-05-18T12:29:42.218222+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/TWYU6CILPKBCR64HLOAHBPVUXU","json":"https://pith.science/pith/TWYU6CILPKBCR64HLOAHBPVUXU.json","graph_json":"https://pith.science/api/pith-number/TWYU6CILPKBCR64HLOAHBPVUXU/graph.json","events_json":"https://pith.science/api/pith-number/TWYU6CILPKBCR64HLOAHBPVUXU/events.json","paper":"https://pith.science/paper/TWYU6CIL"},"agent_actions":{"view_html":"https://pith.science/pith/TWYU6CILPKBCR64HLOAHBPVUXU","download_json":"https://pith.science/pith/TWYU6CILPKBCR64HLOAHBPVUXU.json","view_paper":"https://pith.science/paper/TWYU6CIL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.04048&json=true","fetch_graph":"https://pith.science/api/pith-number/TWYU6CILPKBCR64HLOAHBPVUXU/graph.json","fetch_events":"https://pith.science/api/pith-number/TWYU6CILPKBCR64HLOAHBPVUXU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TWYU6CILPKBCR64HLOAHBPVUXU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TWYU6CILPKBCR64HLOAHBPVUXU/action/storage_attestation","attest_author":"https://pith.science/pith/TWYU6CILPKBCR64HLOAHBPVUXU/action/author_attestation","sign_citation":"https://pith.science/pith/TWYU6CILPKBCR64HLOAHBPVUXU/action/citation_signature","submit_replication":"https://pith.science/pith/TWYU6CILPKBCR64HLOAHBPVUXU/action/replication_record"}},"created_at":"2026-05-18T02:23:57.250805+00:00","updated_at":"2026-05-18T02:23:57.250805+00:00"}