{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:AEU3ZIXMGNQVXUDG7ZVKPVEMJI","short_pith_number":"pith:AEU3ZIXM","schema_version":"1.0","canonical_sha256":"0129bca2ec33615bd066fe6aa7d48c4a041d29323b6c1445af712b9441e2d3d5","source":{"kind":"arxiv","id":"1511.01398","version":1},"attestation_state":"computed","paper":{"title":"Exponential Domination in Subcubic Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dieter Rautenbach, Pascal Ochem, St\\'ephane Bessy","submitted_at":"2015-11-04T17:06:11Z","abstract_excerpt":"As a natural variant of domination in graphs, Dankelmann et al. [Domination with exponential decay, Discrete Math. 309 (2009) 5877-5883] introduce exponential domination, where vertices are considered to have some dominating power that decreases exponentially with the distance, and the dominated vertices have to accumulate a sufficient amount of this power emanating from the dominating vertices. More precisely, if $S$ is a set of vertices of a graph $G$, then $S$ is an exponential dominating set of $G$ if $\\sum\\limits_{v\\in S}\\left(\\frac{1}{2}\\right)^{{\\rm dist}_{(G,S)}(u,v)-1}\\geq 1$ for ever"},"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":"1511.01398","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-11-04T17:06:11Z","cross_cats_sorted":[],"title_canon_sha256":"5e875a9d3453e9ad23c990da7afac076e42db34c05cd127c8247781b91f235e6","abstract_canon_sha256":"9f7af6ca25ea072780097190b274aa96cc323e7e33253d75dde3da67f5997ad7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:27:47.196580Z","signature_b64":"TnlI7A2UzjjKNHcucWQ/EBN+vmfOrWeULRK+ZvjQHd9X8KHKESmsB06NYl22GSyHdlfxOhXW9/8fpNmsO2gGDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0129bca2ec33615bd066fe6aa7d48c4a041d29323b6c1445af712b9441e2d3d5","last_reissued_at":"2026-05-18T01:27:47.195900Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:27:47.195900Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exponential Domination in Subcubic Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dieter Rautenbach, Pascal Ochem, St\\'ephane Bessy","submitted_at":"2015-11-04T17:06:11Z","abstract_excerpt":"As a natural variant of domination in graphs, Dankelmann et al. [Domination with exponential decay, Discrete Math. 309 (2009) 5877-5883] introduce exponential domination, where vertices are considered to have some dominating power that decreases exponentially with the distance, and the dominated vertices have to accumulate a sufficient amount of this power emanating from the dominating vertices. More precisely, if $S$ is a set of vertices of a graph $G$, then $S$ is an exponential dominating set of $G$ if $\\sum\\limits_{v\\in S}\\left(\\frac{1}{2}\\right)^{{\\rm dist}_{(G,S)}(u,v)-1}\\geq 1$ for ever"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.01398","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":"1511.01398","created_at":"2026-05-18T01:27:47.196003+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.01398v1","created_at":"2026-05-18T01:27:47.196003+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.01398","created_at":"2026-05-18T01:27:47.196003+00:00"},{"alias_kind":"pith_short_12","alias_value":"AEU3ZIXMGNQV","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_16","alias_value":"AEU3ZIXMGNQVXUDG","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_8","alias_value":"AEU3ZIXM","created_at":"2026-05-18T12:29:10.953037+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/AEU3ZIXMGNQVXUDG7ZVKPVEMJI","json":"https://pith.science/pith/AEU3ZIXMGNQVXUDG7ZVKPVEMJI.json","graph_json":"https://pith.science/api/pith-number/AEU3ZIXMGNQVXUDG7ZVKPVEMJI/graph.json","events_json":"https://pith.science/api/pith-number/AEU3ZIXMGNQVXUDG7ZVKPVEMJI/events.json","paper":"https://pith.science/paper/AEU3ZIXM"},"agent_actions":{"view_html":"https://pith.science/pith/AEU3ZIXMGNQVXUDG7ZVKPVEMJI","download_json":"https://pith.science/pith/AEU3ZIXMGNQVXUDG7ZVKPVEMJI.json","view_paper":"https://pith.science/paper/AEU3ZIXM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.01398&json=true","fetch_graph":"https://pith.science/api/pith-number/AEU3ZIXMGNQVXUDG7ZVKPVEMJI/graph.json","fetch_events":"https://pith.science/api/pith-number/AEU3ZIXMGNQVXUDG7ZVKPVEMJI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AEU3ZIXMGNQVXUDG7ZVKPVEMJI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AEU3ZIXMGNQVXUDG7ZVKPVEMJI/action/storage_attestation","attest_author":"https://pith.science/pith/AEU3ZIXMGNQVXUDG7ZVKPVEMJI/action/author_attestation","sign_citation":"https://pith.science/pith/AEU3ZIXMGNQVXUDG7ZVKPVEMJI/action/citation_signature","submit_replication":"https://pith.science/pith/AEU3ZIXMGNQVXUDG7ZVKPVEMJI/action/replication_record"}},"created_at":"2026-05-18T01:27:47.196003+00:00","updated_at":"2026-05-18T01:27:47.196003+00:00"}