{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:TWGTTIBE3XS6WXJPUOHTAN7EKD","short_pith_number":"pith:TWGTTIBE","schema_version":"1.0","canonical_sha256":"9d8d39a024dde5eb5d2fa38f3037e450da902458a045d400593c9805acab0347","source":{"kind":"arxiv","id":"1703.05102","version":2},"attestation_state":"computed","paper":{"title":"Algorithms for outerplanar graph roots and graph roots of pathwidth at most 2","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Daniel Paulusma, Dieter Kratsch, Paloma T. Lima, Petr A. Golovach, Pinar Heggernes","submitted_at":"2017-03-15T12:06:53Z","abstract_excerpt":"Deciding whether a given graph has a square root is a classical problem that has been studied extensively both from graph theoretic and from algorithmic perspectives. The problem is NP-complete in general, and consequently substantial effort has been dedicated to deciding whether a given graph has a square root that belongs to a particular graph class. There are both polynomial-time solvable and NP-complete cases, depending on the graph class. We contribute with new results in this direction. Given an arbitrary input graph G, we give polynomial-time algorithms to decide whether G has an outerp"},"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":"1703.05102","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-03-15T12:06:53Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"0fe88c310926d09c2b5f14a299f528b7e5daedba1da264114f14f8a97810a637","abstract_canon_sha256":"b6c49916fffc19b5878a140d1302b3aa93940812298cc565ea5629d55306fa00"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:57.095917Z","signature_b64":"8ml9xW/OcOrIpS7X7fG/quZ8XXBWYykHx9QHigZVpOoFRIyhqEhrGewPloSfCeJ+etoH3McKgSscoSge45G2Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9d8d39a024dde5eb5d2fa38f3037e450da902458a045d400593c9805acab0347","last_reissued_at":"2026-05-18T00:03:57.095211Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:57.095211Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Algorithms for outerplanar graph roots and graph roots of pathwidth at most 2","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Daniel Paulusma, Dieter Kratsch, Paloma T. Lima, Petr A. Golovach, Pinar Heggernes","submitted_at":"2017-03-15T12:06:53Z","abstract_excerpt":"Deciding whether a given graph has a square root is a classical problem that has been studied extensively both from graph theoretic and from algorithmic perspectives. The problem is NP-complete in general, and consequently substantial effort has been dedicated to deciding whether a given graph has a square root that belongs to a particular graph class. There are both polynomial-time solvable and NP-complete cases, depending on the graph class. We contribute with new results in this direction. Given an arbitrary input graph G, we give polynomial-time algorithms to decide whether G has an outerp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.05102","kind":"arxiv","version":2},"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":"1703.05102","created_at":"2026-05-18T00:03:57.095329+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.05102v2","created_at":"2026-05-18T00:03:57.095329+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.05102","created_at":"2026-05-18T00:03:57.095329+00:00"},{"alias_kind":"pith_short_12","alias_value":"TWGTTIBE3XS6","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_16","alias_value":"TWGTTIBE3XS6WXJP","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_8","alias_value":"TWGTTIBE","created_at":"2026-05-18T12:31:46.661854+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/TWGTTIBE3XS6WXJPUOHTAN7EKD","json":"https://pith.science/pith/TWGTTIBE3XS6WXJPUOHTAN7EKD.json","graph_json":"https://pith.science/api/pith-number/TWGTTIBE3XS6WXJPUOHTAN7EKD/graph.json","events_json":"https://pith.science/api/pith-number/TWGTTIBE3XS6WXJPUOHTAN7EKD/events.json","paper":"https://pith.science/paper/TWGTTIBE"},"agent_actions":{"view_html":"https://pith.science/pith/TWGTTIBE3XS6WXJPUOHTAN7EKD","download_json":"https://pith.science/pith/TWGTTIBE3XS6WXJPUOHTAN7EKD.json","view_paper":"https://pith.science/paper/TWGTTIBE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.05102&json=true","fetch_graph":"https://pith.science/api/pith-number/TWGTTIBE3XS6WXJPUOHTAN7EKD/graph.json","fetch_events":"https://pith.science/api/pith-number/TWGTTIBE3XS6WXJPUOHTAN7EKD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TWGTTIBE3XS6WXJPUOHTAN7EKD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TWGTTIBE3XS6WXJPUOHTAN7EKD/action/storage_attestation","attest_author":"https://pith.science/pith/TWGTTIBE3XS6WXJPUOHTAN7EKD/action/author_attestation","sign_citation":"https://pith.science/pith/TWGTTIBE3XS6WXJPUOHTAN7EKD/action/citation_signature","submit_replication":"https://pith.science/pith/TWGTTIBE3XS6WXJPUOHTAN7EKD/action/replication_record"}},"created_at":"2026-05-18T00:03:57.095329+00:00","updated_at":"2026-05-18T00:03:57.095329+00:00"}