{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:X6BYJXDVX5SOETSCU7B4CZBYZH","short_pith_number":"pith:X6BYJXDV","schema_version":"1.0","canonical_sha256":"bf8384dc75bf64e24e42a7c3c16438c9c1d5e34fb571224e463694e2854d5cc5","source":{"kind":"arxiv","id":"1201.1728","version":3},"attestation_state":"computed","paper":{"title":"Worst-case efficient dominating sets in digraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.CO","authors_text":"Italo J. Dejter","submitted_at":"2012-01-09T10:25:11Z","abstract_excerpt":"Let $1\\le n\\in\\Z$. {\\it Worst-case efficient dominating sets in digraphs} are conceived so that their presence in certain strong digraphs $\\vec{ST}_n$ corresponds to that of efficient dominating sets in star graphs $ST_n$: The fact that the star graphs $ST_n$ form a so-called dense segmental neighborly E-chain is reflected in a corresponding fact for the digraphs $\\vec{ST}_n$. Related chains of graphs and open problems are presented as well."},"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":"1201.1728","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-01-09T10:25:11Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"2a9b08e446ebe93e757e8c98a4160b7e91e38624e846715c2d7db59945570bee","abstract_canon_sha256":"9837d4fbf303ddf8fb6bfed634f90593f0aba0e031a367f3915f65f458da0710"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:52:28.206806Z","signature_b64":"d4UCS1i004709X6vehGmpuliojzgumvWI80rM0w3lFYCNzjtP2SRGHu/7sT4eOqvcbjmUwhYkVC5WflNW3gwBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bf8384dc75bf64e24e42a7c3c16438c9c1d5e34fb571224e463694e2854d5cc5","last_reissued_at":"2026-05-18T03:52:28.206001Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:52:28.206001Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Worst-case efficient dominating sets in digraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.CO","authors_text":"Italo J. Dejter","submitted_at":"2012-01-09T10:25:11Z","abstract_excerpt":"Let $1\\le n\\in\\Z$. {\\it Worst-case efficient dominating sets in digraphs} are conceived so that their presence in certain strong digraphs $\\vec{ST}_n$ corresponds to that of efficient dominating sets in star graphs $ST_n$: The fact that the star graphs $ST_n$ form a so-called dense segmental neighborly E-chain is reflected in a corresponding fact for the digraphs $\\vec{ST}_n$. Related chains of graphs and open problems are presented as well."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.1728","kind":"arxiv","version":3},"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":"1201.1728","created_at":"2026-05-18T03:52:28.206139+00:00"},{"alias_kind":"arxiv_version","alias_value":"1201.1728v3","created_at":"2026-05-18T03:52:28.206139+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.1728","created_at":"2026-05-18T03:52:28.206139+00:00"},{"alias_kind":"pith_short_12","alias_value":"X6BYJXDVX5SO","created_at":"2026-05-18T12:27:27.928770+00:00"},{"alias_kind":"pith_short_16","alias_value":"X6BYJXDVX5SOETSC","created_at":"2026-05-18T12:27:27.928770+00:00"},{"alias_kind":"pith_short_8","alias_value":"X6BYJXDV","created_at":"2026-05-18T12:27:27.928770+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/X6BYJXDVX5SOETSCU7B4CZBYZH","json":"https://pith.science/pith/X6BYJXDVX5SOETSCU7B4CZBYZH.json","graph_json":"https://pith.science/api/pith-number/X6BYJXDVX5SOETSCU7B4CZBYZH/graph.json","events_json":"https://pith.science/api/pith-number/X6BYJXDVX5SOETSCU7B4CZBYZH/events.json","paper":"https://pith.science/paper/X6BYJXDV"},"agent_actions":{"view_html":"https://pith.science/pith/X6BYJXDVX5SOETSCU7B4CZBYZH","download_json":"https://pith.science/pith/X6BYJXDVX5SOETSCU7B4CZBYZH.json","view_paper":"https://pith.science/paper/X6BYJXDV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1201.1728&json=true","fetch_graph":"https://pith.science/api/pith-number/X6BYJXDVX5SOETSCU7B4CZBYZH/graph.json","fetch_events":"https://pith.science/api/pith-number/X6BYJXDVX5SOETSCU7B4CZBYZH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X6BYJXDVX5SOETSCU7B4CZBYZH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X6BYJXDVX5SOETSCU7B4CZBYZH/action/storage_attestation","attest_author":"https://pith.science/pith/X6BYJXDVX5SOETSCU7B4CZBYZH/action/author_attestation","sign_citation":"https://pith.science/pith/X6BYJXDVX5SOETSCU7B4CZBYZH/action/citation_signature","submit_replication":"https://pith.science/pith/X6BYJXDVX5SOETSCU7B4CZBYZH/action/replication_record"}},"created_at":"2026-05-18T03:52:28.206139+00:00","updated_at":"2026-05-18T03:52:28.206139+00:00"}