{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:ZARBQ2TVFVSZD2TUAWD3ACIX4U","short_pith_number":"pith:ZARBQ2TV","schema_version":"1.0","canonical_sha256":"c822186a752d6591ea740587b00917e517d7509a8b7bea14986574e09a47f849","source":{"kind":"arxiv","id":"1111.1426","version":2},"attestation_state":"computed","paper":{"title":"SLIQ: Simple Linear Inequalities for Efficient Contig Scaffolding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CE"],"primary_cat":"q-bio.GN","authors_text":"Alexander Schliep, Anirvan M. Sengupta, Kevin C. Chen, Rajat S. Roy","submitted_at":"2011-11-06T15:46:57Z","abstract_excerpt":"Scaffolding is an important subproblem in \"de novo\" genome assembly in which mate pair data are used to construct a linear sequence of contigs separated by gaps. Here we present SLIQ, a set of simple linear inequalities derived from the geometry of contigs on the line that can be used to predict the relative positions and orientations of contigs from individual mate pair reads and thus produce a contig digraph. The SLIQ inequalities can also filter out unreliable mate pairs and can be used as a preprocessing step for any scaffolding algorithm. We tested the SLIQ inequalities on five real data "},"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":"1111.1426","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.GN","submitted_at":"2011-11-06T15:46:57Z","cross_cats_sorted":["cs.CE"],"title_canon_sha256":"086f5a9a02ae4acdf35e404886b8a00627b535ae167f4dc80e92ea95aaff487f","abstract_canon_sha256":"690d9c67181254e6a5da105c6b5b0e68634842093d7ca83b99b08955aa46552a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:08:44.272881Z","signature_b64":"vkJ369czztcqdo90STGasWubiUS0gBZI/Tc805qJl63HyRkm052WbP4fJgb+u2JJmF5rrMa+3IMQu8oHxMzFAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c822186a752d6591ea740587b00917e517d7509a8b7bea14986574e09a47f849","last_reissued_at":"2026-05-18T04:08:44.272206Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:08:44.272206Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"SLIQ: Simple Linear Inequalities for Efficient Contig Scaffolding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CE"],"primary_cat":"q-bio.GN","authors_text":"Alexander Schliep, Anirvan M. Sengupta, Kevin C. Chen, Rajat S. Roy","submitted_at":"2011-11-06T15:46:57Z","abstract_excerpt":"Scaffolding is an important subproblem in \"de novo\" genome assembly in which mate pair data are used to construct a linear sequence of contigs separated by gaps. Here we present SLIQ, a set of simple linear inequalities derived from the geometry of contigs on the line that can be used to predict the relative positions and orientations of contigs from individual mate pair reads and thus produce a contig digraph. The SLIQ inequalities can also filter out unreliable mate pairs and can be used as a preprocessing step for any scaffolding algorithm. We tested the SLIQ inequalities on five real data "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.1426","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":"1111.1426","created_at":"2026-05-18T04:08:44.272329+00:00"},{"alias_kind":"arxiv_version","alias_value":"1111.1426v2","created_at":"2026-05-18T04:08:44.272329+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.1426","created_at":"2026-05-18T04:08:44.272329+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZARBQ2TVFVSZ","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZARBQ2TVFVSZD2TU","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZARBQ2TV","created_at":"2026-05-18T12:26:47.523578+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/ZARBQ2TVFVSZD2TUAWD3ACIX4U","json":"https://pith.science/pith/ZARBQ2TVFVSZD2TUAWD3ACIX4U.json","graph_json":"https://pith.science/api/pith-number/ZARBQ2TVFVSZD2TUAWD3ACIX4U/graph.json","events_json":"https://pith.science/api/pith-number/ZARBQ2TVFVSZD2TUAWD3ACIX4U/events.json","paper":"https://pith.science/paper/ZARBQ2TV"},"agent_actions":{"view_html":"https://pith.science/pith/ZARBQ2TVFVSZD2TUAWD3ACIX4U","download_json":"https://pith.science/pith/ZARBQ2TVFVSZD2TUAWD3ACIX4U.json","view_paper":"https://pith.science/paper/ZARBQ2TV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1111.1426&json=true","fetch_graph":"https://pith.science/api/pith-number/ZARBQ2TVFVSZD2TUAWD3ACIX4U/graph.json","fetch_events":"https://pith.science/api/pith-number/ZARBQ2TVFVSZD2TUAWD3ACIX4U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZARBQ2TVFVSZD2TUAWD3ACIX4U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZARBQ2TVFVSZD2TUAWD3ACIX4U/action/storage_attestation","attest_author":"https://pith.science/pith/ZARBQ2TVFVSZD2TUAWD3ACIX4U/action/author_attestation","sign_citation":"https://pith.science/pith/ZARBQ2TVFVSZD2TUAWD3ACIX4U/action/citation_signature","submit_replication":"https://pith.science/pith/ZARBQ2TVFVSZD2TUAWD3ACIX4U/action/replication_record"}},"created_at":"2026-05-18T04:08:44.272329+00:00","updated_at":"2026-05-18T04:08:44.272329+00:00"}