{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:QMCEV7KZDTCAKYUAXR7G52WWEC","short_pith_number":"pith:QMCEV7KZ","schema_version":"1.0","canonical_sha256":"83044afd591cc4056280bc7e6eead620ba2599fc8d843d76c9adc1e5ae8463f0","source":{"kind":"arxiv","id":"2010.05733","version":1},"attestation_state":"computed","paper":{"title":"Graph Square Roots of Small Distance from Degree One Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Charis Papadopoulos, Paloma T. Lima, Petr A. Golovach","submitted_at":"2020-10-12T14:27:07Z","abstract_excerpt":"Given a graph class $\\mathcal{H}$, the task of the $\\mathcal{H}$-Square Root problem is to decide, whether an input graph $G$ has a square root $H$ from $\\mathcal{H}$. We are interested in the parameterized complexity of the problem for classes $\\mathcal{H}$ that are composed by the graphs at vertex deletion distance at most $k$ from graphs of maximum degree at most one, that is, we are looking for a square root $H$ such that there is a modulator $S$ of size $k$ such that $H-S$ is the disjoint union of isolated vertices and disjoint edges. We show that different variants of the problems with c"},"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":"2010.05733","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-10-12T14:27:07Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"a31f55e183e15390d8f63eef39f81a86efaaa5c102cc98b547c38c5fd8a8cf19","abstract_canon_sha256":"6ee900f6033131de0e32a14f08ac9598d3c1f50090a044fc43e526276e0d7719"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:42:10.200081Z","signature_b64":"Fb0z5DsT7f+PQ8LG1t6FMzmFiDNDLy8s3fYBzkwqFc4lwg7JGMePh3yvoFxw2GPPDll2WZP24gocfvJp+krzBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"83044afd591cc4056280bc7e6eead620ba2599fc8d843d76c9adc1e5ae8463f0","last_reissued_at":"2026-07-05T01:42:10.199641Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:42:10.199641Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph Square Roots of Small Distance from Degree One Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Charis Papadopoulos, Paloma T. Lima, Petr A. Golovach","submitted_at":"2020-10-12T14:27:07Z","abstract_excerpt":"Given a graph class $\\mathcal{H}$, the task of the $\\mathcal{H}$-Square Root problem is to decide, whether an input graph $G$ has a square root $H$ from $\\mathcal{H}$. We are interested in the parameterized complexity of the problem for classes $\\mathcal{H}$ that are composed by the graphs at vertex deletion distance at most $k$ from graphs of maximum degree at most one, that is, we are looking for a square root $H$ such that there is a modulator $S$ of size $k$ such that $H-S$ is the disjoint union of isolated vertices and disjoint edges. We show that different variants of the problems with c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.05733","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/2010.05733/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":"2010.05733","created_at":"2026-07-05T01:42:10.199704+00:00"},{"alias_kind":"arxiv_version","alias_value":"2010.05733v1","created_at":"2026-07-05T01:42:10.199704+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.05733","created_at":"2026-07-05T01:42:10.199704+00:00"},{"alias_kind":"pith_short_12","alias_value":"QMCEV7KZDTCA","created_at":"2026-07-05T01:42:10.199704+00:00"},{"alias_kind":"pith_short_16","alias_value":"QMCEV7KZDTCAKYUA","created_at":"2026-07-05T01:42:10.199704+00:00"},{"alias_kind":"pith_short_8","alias_value":"QMCEV7KZ","created_at":"2026-07-05T01:42:10.199704+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/QMCEV7KZDTCAKYUAXR7G52WWEC","json":"https://pith.science/pith/QMCEV7KZDTCAKYUAXR7G52WWEC.json","graph_json":"https://pith.science/api/pith-number/QMCEV7KZDTCAKYUAXR7G52WWEC/graph.json","events_json":"https://pith.science/api/pith-number/QMCEV7KZDTCAKYUAXR7G52WWEC/events.json","paper":"https://pith.science/paper/QMCEV7KZ"},"agent_actions":{"view_html":"https://pith.science/pith/QMCEV7KZDTCAKYUAXR7G52WWEC","download_json":"https://pith.science/pith/QMCEV7KZDTCAKYUAXR7G52WWEC.json","view_paper":"https://pith.science/paper/QMCEV7KZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2010.05733&json=true","fetch_graph":"https://pith.science/api/pith-number/QMCEV7KZDTCAKYUAXR7G52WWEC/graph.json","fetch_events":"https://pith.science/api/pith-number/QMCEV7KZDTCAKYUAXR7G52WWEC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QMCEV7KZDTCAKYUAXR7G52WWEC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QMCEV7KZDTCAKYUAXR7G52WWEC/action/storage_attestation","attest_author":"https://pith.science/pith/QMCEV7KZDTCAKYUAXR7G52WWEC/action/author_attestation","sign_citation":"https://pith.science/pith/QMCEV7KZDTCAKYUAXR7G52WWEC/action/citation_signature","submit_replication":"https://pith.science/pith/QMCEV7KZDTCAKYUAXR7G52WWEC/action/replication_record"}},"created_at":"2026-07-05T01:42:10.199704+00:00","updated_at":"2026-07-05T01:42:10.199704+00:00"}