{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:GR7FIXDQBCWY3AE6456LLPLDPQ","short_pith_number":"pith:GR7FIXDQ","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"},"canonical_sha256":"347e545c7008ad8d809ee77cb5bd637c36b3d29c5c6b12999ec32cacccb462ce","source":{"kind":"arxiv","id":"1307.5547","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.5547","created_at":"2026-05-18T03:17:55Z"},{"alias_kind":"arxiv_version","alias_value":"1307.5547v1","created_at":"2026-05-18T03:17:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.5547","created_at":"2026-05-18T03:17:55Z"},{"alias_kind":"pith_short_12","alias_value":"GR7FIXDQBCWY","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"GR7FIXDQBCWY3AE6","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"GR7FIXDQ","created_at":"2026-05-18T12:27:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:GR7FIXDQBCWY3AE6456LLPLDPQ","target":"record","payload":{"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"},"canonical_sha256":"347e545c7008ad8d809ee77cb5bd637c36b3d29c5c6b12999ec32cacccb462ce","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"},"source_kind":"arxiv","source_id":"1307.5547","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:17:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mYmwuRj9cSeBqrIOXzm7OZzRY3xrPUesVB6M1y3xJmVlhkj6V6rxg08EL7TMfbKuZ4jIca1hkM5k9Pi8yZUECg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T20:01:21.942295Z"},"content_sha256":"12b5b63df78a5b6d5dfce63a37065d10fc460e185b7d7ceefb983a489b14fbdd","schema_version":"1.0","event_id":"sha256:12b5b63df78a5b6d5dfce63a37065d10fc460e185b7d7ceefb983a489b14fbdd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:GR7FIXDQBCWY3AE6456LLPLDPQ","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:17:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aOOeGvcR8og9cmlskpWIjXinyJLz4kTZvWJQ8C4Vcb93Ags0hb5Dzr3Mp+GRiaJetUkbgKgGBLuIF+bDO92MAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T20:01:21.942915Z"},"content_sha256":"41ec0221d980ca91d7e6ebe6aaa66efc97eb091499270ba591b10236f706cd65","schema_version":"1.0","event_id":"sha256:41ec0221d980ca91d7e6ebe6aaa66efc97eb091499270ba591b10236f706cd65"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GR7FIXDQBCWY3AE6456LLPLDPQ/bundle.json","state_url":"https://pith.science/pith/GR7FIXDQBCWY3AE6456LLPLDPQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GR7FIXDQBCWY3AE6456LLPLDPQ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-31T20:01:21Z","links":{"resolver":"https://pith.science/pith/GR7FIXDQBCWY3AE6456LLPLDPQ","bundle":"https://pith.science/pith/GR7FIXDQBCWY3AE6456LLPLDPQ/bundle.json","state":"https://pith.science/pith/GR7FIXDQBCWY3AE6456LLPLDPQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GR7FIXDQBCWY3AE6456LLPLDPQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:GR7FIXDQBCWY3AE6456LLPLDPQ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"b606dc54efb6a66b6a4a9d0251862c1be91be8b1b3ed76982dad313ea49f1ee4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-07-21T17:16:50Z","title_canon_sha256":"58e688f43d4255604742b62c4314105f20a3754f9ddc18b10109060a2b294dc2"},"schema_version":"1.0","source":{"id":"1307.5547","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.5547","created_at":"2026-05-18T03:17:55Z"},{"alias_kind":"arxiv_version","alias_value":"1307.5547v1","created_at":"2026-05-18T03:17:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.5547","created_at":"2026-05-18T03:17:55Z"},{"alias_kind":"pith_short_12","alias_value":"GR7FIXDQBCWY","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"GR7FIXDQBCWY3AE6","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"GR7FIXDQ","created_at":"2026-05-18T12:27:45Z"}],"graph_snapshots":[{"event_id":"sha256:41ec0221d980ca91d7e6ebe6aaa66efc97eb091499270ba591b10236f706cd65","target":"graph","created_at":"2026-05-18T03:17:55Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Ross M. McConnell, Yahav Nussbaum","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-07-21T17:16:50Z","title":"Linear-Time Recognition of Probe Interval Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.5547","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:12b5b63df78a5b6d5dfce63a37065d10fc460e185b7d7ceefb983a489b14fbdd","target":"record","created_at":"2026-05-18T03:17:55Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"b606dc54efb6a66b6a4a9d0251862c1be91be8b1b3ed76982dad313ea49f1ee4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-07-21T17:16:50Z","title_canon_sha256":"58e688f43d4255604742b62c4314105f20a3754f9ddc18b10109060a2b294dc2"},"schema_version":"1.0","source":{"id":"1307.5547","kind":"arxiv","version":1}},"canonical_sha256":"347e545c7008ad8d809ee77cb5bd637c36b3d29c5c6b12999ec32cacccb462ce","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"347e545c7008ad8d809ee77cb5bd637c36b3d29c5c6b12999ec32cacccb462ce","first_computed_at":"2026-05-18T03:17:55.370958Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:17:55.370958Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6xD/Cur35fRFkm8++9S2z3w0p9mCCqQqooskkXv0spWPOWBnU4MB+UvxZ9ALDXThkkHPZceuon7rtXK0TB1sBg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:17:55.371486Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.5547","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:12b5b63df78a5b6d5dfce63a37065d10fc460e185b7d7ceefb983a489b14fbdd","sha256:41ec0221d980ca91d7e6ebe6aaa66efc97eb091499270ba591b10236f706cd65"],"state_sha256":"3118ffe05fb61e6ed8b6f4a25002770bc8d9eb994d30b25bacc921e7bb077c54"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QQ6E6JlV71TM+QOdUSCKEoR4Bwc1vTwU0+kidMy52X2V1XgqZJSIOoN4uZV1lkV7WLyIG9B9ixuzoA2fkGuNCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T20:01:21.948703Z","bundle_sha256":"3abd07e7dbcb186057a52b8c44621491458d1750d70bf94981290c9664b3c136"}}