{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:W3SK3JAHVVLYBO5D6654PKJEFK","short_pith_number":"pith:W3SK3JAH","schema_version":"1.0","canonical_sha256":"b6e4ada407ad5780bba3f7bbc7a9242aa7c397bd562ff8476692782a151a3c4b","source":{"kind":"arxiv","id":"1306.3181","version":1},"attestation_state":"computed","paper":{"title":"An Efficient Branching Algorithm for Interval Completion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Yixin Cao","submitted_at":"2013-06-13T18:22:43Z","abstract_excerpt":"We study the \\emph{{interval completion}} problem, which asks for the insertion of a set of at most $k$ edges to make a graph of $n$ vertices into an interval graph. We focus on chordal graphs with no small obstructions, where every remaining obstruction is known to have a shallow property. From such a shallow obstruction we single out a subset 6 or 7 vertices, called the frame, and 5 missed edges in the subgraph induced by the frame. We show that if none of these edges is inserted, then the frame cannot be altered at all, and the whole obstruction is also fixed, by and large, in the sense tha"},"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":"1306.3181","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-06-13T18:22:43Z","cross_cats_sorted":[],"title_canon_sha256":"01effa2a86a0fad95df4f9b16b57fb21b9dd0800f5e9c9dd32059a8ebb427a53","abstract_canon_sha256":"1919b1c74f9834299488df929a684a40b25b43730f7550365075fa64820e8590"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:20:59.406300Z","signature_b64":"NezIvWbs39HE49zjyj9kVPLl+es0OuMNacWrwece303DdjqGo2SxDDxMK9g19ecVmb62hORqorR2o65GthSVDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b6e4ada407ad5780bba3f7bbc7a9242aa7c397bd562ff8476692782a151a3c4b","last_reissued_at":"2026-05-18T03:20:59.405603Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:20:59.405603Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Efficient Branching Algorithm for Interval Completion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Yixin Cao","submitted_at":"2013-06-13T18:22:43Z","abstract_excerpt":"We study the \\emph{{interval completion}} problem, which asks for the insertion of a set of at most $k$ edges to make a graph of $n$ vertices into an interval graph. We focus on chordal graphs with no small obstructions, where every remaining obstruction is known to have a shallow property. From such a shallow obstruction we single out a subset 6 or 7 vertices, called the frame, and 5 missed edges in the subgraph induced by the frame. We show that if none of these edges is inserted, then the frame cannot be altered at all, and the whole obstruction is also fixed, by and large, in the sense tha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.3181","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":"1306.3181","created_at":"2026-05-18T03:20:59.405714+00:00"},{"alias_kind":"arxiv_version","alias_value":"1306.3181v1","created_at":"2026-05-18T03:20:59.405714+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.3181","created_at":"2026-05-18T03:20:59.405714+00:00"},{"alias_kind":"pith_short_12","alias_value":"W3SK3JAHVVLY","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_16","alias_value":"W3SK3JAHVVLYBO5D","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_8","alias_value":"W3SK3JAH","created_at":"2026-05-18T12:28:04.890932+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/W3SK3JAHVVLYBO5D6654PKJEFK","json":"https://pith.science/pith/W3SK3JAHVVLYBO5D6654PKJEFK.json","graph_json":"https://pith.science/api/pith-number/W3SK3JAHVVLYBO5D6654PKJEFK/graph.json","events_json":"https://pith.science/api/pith-number/W3SK3JAHVVLYBO5D6654PKJEFK/events.json","paper":"https://pith.science/paper/W3SK3JAH"},"agent_actions":{"view_html":"https://pith.science/pith/W3SK3JAHVVLYBO5D6654PKJEFK","download_json":"https://pith.science/pith/W3SK3JAHVVLYBO5D6654PKJEFK.json","view_paper":"https://pith.science/paper/W3SK3JAH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1306.3181&json=true","fetch_graph":"https://pith.science/api/pith-number/W3SK3JAHVVLYBO5D6654PKJEFK/graph.json","fetch_events":"https://pith.science/api/pith-number/W3SK3JAHVVLYBO5D6654PKJEFK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/W3SK3JAHVVLYBO5D6654PKJEFK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/W3SK3JAHVVLYBO5D6654PKJEFK/action/storage_attestation","attest_author":"https://pith.science/pith/W3SK3JAHVVLYBO5D6654PKJEFK/action/author_attestation","sign_citation":"https://pith.science/pith/W3SK3JAHVVLYBO5D6654PKJEFK/action/citation_signature","submit_replication":"https://pith.science/pith/W3SK3JAHVVLYBO5D6654PKJEFK/action/replication_record"}},"created_at":"2026-05-18T03:20:59.405714+00:00","updated_at":"2026-05-18T03:20:59.405714+00:00"}