{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:JP5TTXZSL5ORX2ZDQ4NXFBLOMW","short_pith_number":"pith:JP5TTXZS","schema_version":"1.0","canonical_sha256":"4bfb39df325f5d1beb23871b72856e6593b62af7337c0c5c614939c7dd5c3454","source":{"kind":"arxiv","id":"1201.6207","version":2},"attestation_state":"computed","paper":{"title":"k-Probe DH-graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"T. Kloks","submitted_at":"2012-01-30T13:51:10Z","abstract_excerpt":"Let k be a natural number. Let G be a graph and let N_1,...,N_k be k independent sets in G. The graph G is k-probe distance hereditary if G can be embedded into a DH-graph by adding edges between vertices that are contained in the same independent set. We show that there exists a polynomial-time algorithm to check if a graph G is k-probe distance hereditary."},"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.6207","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-01-30T13:51:10Z","cross_cats_sorted":[],"title_canon_sha256":"d602522248e8570d48d2d3c25d659e73f7289aae31426b19d91f52834fcc327e","abstract_canon_sha256":"d24301660c096b8353cae78cbc81c39479f3d2a2c07b6d97a623cf24f230d428"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:03:18.872211Z","signature_b64":"8m6WPArWVCr4brosVQ36gI4MqZ3GPugDreK9osIOtmspa3pyF9fVK8gto0TmwheAPV1F70rIYCUTzj9B2H6MAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4bfb39df325f5d1beb23871b72856e6593b62af7337c0c5c614939c7dd5c3454","last_reissued_at":"2026-05-18T04:03:18.871739Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:03:18.871739Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"k-Probe DH-graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"T. Kloks","submitted_at":"2012-01-30T13:51:10Z","abstract_excerpt":"Let k be a natural number. Let G be a graph and let N_1,...,N_k be k independent sets in G. The graph G is k-probe distance hereditary if G can be embedded into a DH-graph by adding edges between vertices that are contained in the same independent set. We show that there exists a polynomial-time algorithm to check if a graph G is k-probe distance hereditary."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.6207","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":"1201.6207","created_at":"2026-05-18T04:03:18.871811+00:00"},{"alias_kind":"arxiv_version","alias_value":"1201.6207v2","created_at":"2026-05-18T04:03:18.871811+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.6207","created_at":"2026-05-18T04:03:18.871811+00:00"},{"alias_kind":"pith_short_12","alias_value":"JP5TTXZSL5OR","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_16","alias_value":"JP5TTXZSL5ORX2ZD","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_8","alias_value":"JP5TTXZS","created_at":"2026-05-18T12:27:11.947152+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/JP5TTXZSL5ORX2ZDQ4NXFBLOMW","json":"https://pith.science/pith/JP5TTXZSL5ORX2ZDQ4NXFBLOMW.json","graph_json":"https://pith.science/api/pith-number/JP5TTXZSL5ORX2ZDQ4NXFBLOMW/graph.json","events_json":"https://pith.science/api/pith-number/JP5TTXZSL5ORX2ZDQ4NXFBLOMW/events.json","paper":"https://pith.science/paper/JP5TTXZS"},"agent_actions":{"view_html":"https://pith.science/pith/JP5TTXZSL5ORX2ZDQ4NXFBLOMW","download_json":"https://pith.science/pith/JP5TTXZSL5ORX2ZDQ4NXFBLOMW.json","view_paper":"https://pith.science/paper/JP5TTXZS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1201.6207&json=true","fetch_graph":"https://pith.science/api/pith-number/JP5TTXZSL5ORX2ZDQ4NXFBLOMW/graph.json","fetch_events":"https://pith.science/api/pith-number/JP5TTXZSL5ORX2ZDQ4NXFBLOMW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JP5TTXZSL5ORX2ZDQ4NXFBLOMW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JP5TTXZSL5ORX2ZDQ4NXFBLOMW/action/storage_attestation","attest_author":"https://pith.science/pith/JP5TTXZSL5ORX2ZDQ4NXFBLOMW/action/author_attestation","sign_citation":"https://pith.science/pith/JP5TTXZSL5ORX2ZDQ4NXFBLOMW/action/citation_signature","submit_replication":"https://pith.science/pith/JP5TTXZSL5ORX2ZDQ4NXFBLOMW/action/replication_record"}},"created_at":"2026-05-18T04:03:18.871811+00:00","updated_at":"2026-05-18T04:03:18.871811+00:00"}