{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:GR7FIXDQBCWY3AE6456LLPLDPQ","short_pith_number":"pith:GR7FIXDQ","schema_version":"1.0","canonical_sha256":"347e545c7008ad8d809ee77cb5bd637c36b3d29c5c6b12999ec32cacccb462ce","source":{"kind":"arxiv","id":"1307.5547","version":1},"attestation_state":"computed","paper":{"title":"Linear-Time Recognition of Probe Interval Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ross M. McConnell, Yahav Nussbaum","submitted_at":"2013-07-21T17:16:50Z","abstract_excerpt":"The interval graph for a set of intervals on a line consists of one vertex for each interval, and an edge for each intersecting pair of intervals. A probe interval graph is a variant that is motivated by an application to genomics, where the intervals are partitioned into two sets: probes and non-probes. The graph has an edge between two vertices if they intersect and at least one of them is a probe. We give a linear-time algorithm for determining whether a given graph and partition of vertices into probes and non-probes is a probe interval graph. If it is, we give a layout of intervals that p"},"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":"1307.5547","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-07-21T17:16:50Z","cross_cats_sorted":[],"title_canon_sha256":"58e688f43d4255604742b62c4314105f20a3754f9ddc18b10109060a2b294dc2","abstract_canon_sha256":"b606dc54efb6a66b6a4a9d0251862c1be91be8b1b3ed76982dad313ea49f1ee4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:17:55.371486Z","signature_b64":"6xD/Cur35fRFkm8++9S2z3w0p9mCCqQqooskkXv0spWPOWBnU4MB+UvxZ9ALDXThkkHPZceuon7rtXK0TB1sBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"347e545c7008ad8d809ee77cb5bd637c36b3d29c5c6b12999ec32cacccb462ce","last_reissued_at":"2026-05-18T03:17:55.370958Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:17:55.370958Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Linear-Time Recognition of Probe Interval Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ross M. McConnell, Yahav Nussbaum","submitted_at":"2013-07-21T17:16:50Z","abstract_excerpt":"The interval graph for a set of intervals on a line consists of one vertex for each interval, and an edge for each intersecting pair of intervals. A probe interval graph is a variant that is motivated by an application to genomics, where the intervals are partitioned into two sets: probes and non-probes. The graph has an edge between two vertices if they intersect and at least one of them is a probe. We give a linear-time algorithm for determining whether a given graph and partition of vertices into probes and non-probes is a probe interval graph. If it is, we give a layout of intervals that p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.5547","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":"1307.5547","created_at":"2026-05-18T03:17:55.371045+00:00"},{"alias_kind":"arxiv_version","alias_value":"1307.5547v1","created_at":"2026-05-18T03:17:55.371045+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.5547","created_at":"2026-05-18T03:17:55.371045+00:00"},{"alias_kind":"pith_short_12","alias_value":"GR7FIXDQBCWY","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_16","alias_value":"GR7FIXDQBCWY3AE6","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_8","alias_value":"GR7FIXDQ","created_at":"2026-05-18T12:27:45.050594+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/GR7FIXDQBCWY3AE6456LLPLDPQ","json":"https://pith.science/pith/GR7FIXDQBCWY3AE6456LLPLDPQ.json","graph_json":"https://pith.science/api/pith-number/GR7FIXDQBCWY3AE6456LLPLDPQ/graph.json","events_json":"https://pith.science/api/pith-number/GR7FIXDQBCWY3AE6456LLPLDPQ/events.json","paper":"https://pith.science/paper/GR7FIXDQ"},"agent_actions":{"view_html":"https://pith.science/pith/GR7FIXDQBCWY3AE6456LLPLDPQ","download_json":"https://pith.science/pith/GR7FIXDQBCWY3AE6456LLPLDPQ.json","view_paper":"https://pith.science/paper/GR7FIXDQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1307.5547&json=true","fetch_graph":"https://pith.science/api/pith-number/GR7FIXDQBCWY3AE6456LLPLDPQ/graph.json","fetch_events":"https://pith.science/api/pith-number/GR7FIXDQBCWY3AE6456LLPLDPQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GR7FIXDQBCWY3AE6456LLPLDPQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GR7FIXDQBCWY3AE6456LLPLDPQ/action/storage_attestation","attest_author":"https://pith.science/pith/GR7FIXDQBCWY3AE6456LLPLDPQ/action/author_attestation","sign_citation":"https://pith.science/pith/GR7FIXDQBCWY3AE6456LLPLDPQ/action/citation_signature","submit_replication":"https://pith.science/pith/GR7FIXDQBCWY3AE6456LLPLDPQ/action/replication_record"}},"created_at":"2026-05-18T03:17:55.371045+00:00","updated_at":"2026-05-18T03:17:55.371045+00:00"}