{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:A2EYPQY4WHV6HBZRIO3S6LT6JL","short_pith_number":"pith:A2EYPQY4","schema_version":"1.0","canonical_sha256":"068987c31cb1ebe3873143b72f2e7e4ad44398bc0ba21de2fef3ab3968440482","source":{"kind":"arxiv","id":"2411.13141","version":1},"attestation_state":"computed","paper":{"title":"(Independent) Roman Domination Parameterized by Distance to Cluster","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS","math.CO"],"primary_cat":"cs.CC","authors_text":"Arti Pandey, Gautam K. Das, Kaustav Paul, Pradeesha Ashok, Subhabrata Paul","submitted_at":"2024-11-20T09:14:03Z","abstract_excerpt":"Given a graph $G=(V,E)$, a function $f:V\\to \\{0,1,2\\}$ is said to be a \\emph{Roman Dominating function} (RDF) if for every $v\\in V$ with $f(v)=0$, there exists a vertex $u\\in N(v)$ such that $f(u)=2$. A Roman Dominating function $f$ is said to be an \\emph{Independent Roman Dominating function} (IRDF), if $V_1\\cup V_2$ forms an independent set, where $V_i=\\{v\\in V~\\vert~f(v)=i\\}$, for $i\\in \\{0,1,2\\}$. The total weight of $f$ is equal to $\\sum_{v\\in V} f(v)$, and is denoted as $w(f)$. The \\emph{Roman Domination Number} (resp. \\emph{Independent Roman Domination Number}) of $G$, denoted by $\\gamm"},"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":"2411.13141","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2024-11-20T09:14:03Z","cross_cats_sorted":["cs.DM","cs.DS","math.CO"],"title_canon_sha256":"2f6373f005bb215193a0c205ec2c44766725546c6ebc6ef5119de7cfaf8536e4","abstract_canon_sha256":"ec147c7eaa1cda3802b1cf6f96d00695a6f53aa25050bc3f0f1f421913f5c990"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:38:05.654410Z","signature_b64":"GfgyW2vtvxpAbsLvd1Z10HjXiF2N5ftEPGPseX+0EWWyCRdcCYDVtqKzX52U3SrlLRI7eWkBe4mCEdFS9cvTBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"068987c31cb1ebe3873143b72f2e7e4ad44398bc0ba21de2fef3ab3968440482","last_reissued_at":"2026-07-05T09:38:05.654013Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:38:05.654013Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"(Independent) Roman Domination Parameterized by Distance to Cluster","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS","math.CO"],"primary_cat":"cs.CC","authors_text":"Arti Pandey, Gautam K. Das, Kaustav Paul, Pradeesha Ashok, Subhabrata Paul","submitted_at":"2024-11-20T09:14:03Z","abstract_excerpt":"Given a graph $G=(V,E)$, a function $f:V\\to \\{0,1,2\\}$ is said to be a \\emph{Roman Dominating function} (RDF) if for every $v\\in V$ with $f(v)=0$, there exists a vertex $u\\in N(v)$ such that $f(u)=2$. A Roman Dominating function $f$ is said to be an \\emph{Independent Roman Dominating function} (IRDF), if $V_1\\cup V_2$ forms an independent set, where $V_i=\\{v\\in V~\\vert~f(v)=i\\}$, for $i\\in \\{0,1,2\\}$. The total weight of $f$ is equal to $\\sum_{v\\in V} f(v)$, and is denoted as $w(f)$. The \\emph{Roman Domination Number} (resp. \\emph{Independent Roman Domination Number}) of $G$, denoted by $\\gamm"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.13141","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2411.13141/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2411.13141","created_at":"2026-07-05T09:38:05.654069+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.13141v1","created_at":"2026-07-05T09:38:05.654069+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.13141","created_at":"2026-07-05T09:38:05.654069+00:00"},{"alias_kind":"pith_short_12","alias_value":"A2EYPQY4WHV6","created_at":"2026-07-05T09:38:05.654069+00:00"},{"alias_kind":"pith_short_16","alias_value":"A2EYPQY4WHV6HBZR","created_at":"2026-07-05T09:38:05.654069+00:00"},{"alias_kind":"pith_short_8","alias_value":"A2EYPQY4","created_at":"2026-07-05T09:38:05.654069+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/A2EYPQY4WHV6HBZRIO3S6LT6JL","json":"https://pith.science/pith/A2EYPQY4WHV6HBZRIO3S6LT6JL.json","graph_json":"https://pith.science/api/pith-number/A2EYPQY4WHV6HBZRIO3S6LT6JL/graph.json","events_json":"https://pith.science/api/pith-number/A2EYPQY4WHV6HBZRIO3S6LT6JL/events.json","paper":"https://pith.science/paper/A2EYPQY4"},"agent_actions":{"view_html":"https://pith.science/pith/A2EYPQY4WHV6HBZRIO3S6LT6JL","download_json":"https://pith.science/pith/A2EYPQY4WHV6HBZRIO3S6LT6JL.json","view_paper":"https://pith.science/paper/A2EYPQY4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.13141&json=true","fetch_graph":"https://pith.science/api/pith-number/A2EYPQY4WHV6HBZRIO3S6LT6JL/graph.json","fetch_events":"https://pith.science/api/pith-number/A2EYPQY4WHV6HBZRIO3S6LT6JL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A2EYPQY4WHV6HBZRIO3S6LT6JL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A2EYPQY4WHV6HBZRIO3S6LT6JL/action/storage_attestation","attest_author":"https://pith.science/pith/A2EYPQY4WHV6HBZRIO3S6LT6JL/action/author_attestation","sign_citation":"https://pith.science/pith/A2EYPQY4WHV6HBZRIO3S6LT6JL/action/citation_signature","submit_replication":"https://pith.science/pith/A2EYPQY4WHV6HBZRIO3S6LT6JL/action/replication_record"}},"created_at":"2026-07-05T09:38:05.654069+00:00","updated_at":"2026-07-05T09:38:05.654069+00:00"}