{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:WA7PEPZG2QHAO64LZQOKVYAZCI","short_pith_number":"pith:WA7PEPZG","schema_version":"1.0","canonical_sha256":"b03ef23f26d40e077b8bcc1caae019123778d287eafbc8785933628ba0ff6bcc","source":{"kind":"arxiv","id":"1412.1543","version":2},"attestation_state":"computed","paper":{"title":"New Geometric Representations and Domination Problems on Tolerance and Multitolerance Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.CC","authors_text":"Archontia C. Giannopoulou, George B. Mertzios","submitted_at":"2014-12-04T02:39:01Z","abstract_excerpt":"Tolerance graphs model interval relations in such a way that intervals can tolerate a certain amount of overlap without being in conflict. In one of the most natural generalizations of tolerance graphs with direct applications in the comparison of DNA sequences from different organisms, namely multitolerance graphs, two tolerances are allowed for each interval - one from the left and one from the right side. Several efficient algorithms for optimization problems that are NP-hard in general graphs have been designed for tolerance and multitolerance graphs. In spite of this progress, the complex"},"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":"1412.1543","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-12-04T02:39:01Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"fbae039a36215db40a1c29597ee0b4656df63730b8e2e29535b9caf544a4f5c4","abstract_canon_sha256":"8352dae7e9f6e9fd2f2a2ce23d83c68fbb805dec5c685841b2b950bfb7168249"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:14:53.341733Z","signature_b64":"qsX4xeQTHyA57xiojlTHUnBh7+7jbEzjzoVdGzk/rvih7IB6Oavwsj2b3Uv/VLpTI7EAEdUJq+6h4Kqh9Yn1AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b03ef23f26d40e077b8bcc1caae019123778d287eafbc8785933628ba0ff6bcc","last_reissued_at":"2026-05-18T01:14:53.341131Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:14:53.341131Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"New Geometric Representations and Domination Problems on Tolerance and Multitolerance Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.CC","authors_text":"Archontia C. Giannopoulou, George B. Mertzios","submitted_at":"2014-12-04T02:39:01Z","abstract_excerpt":"Tolerance graphs model interval relations in such a way that intervals can tolerate a certain amount of overlap without being in conflict. In one of the most natural generalizations of tolerance graphs with direct applications in the comparison of DNA sequences from different organisms, namely multitolerance graphs, two tolerances are allowed for each interval - one from the left and one from the right side. Several efficient algorithms for optimization problems that are NP-hard in general graphs have been designed for tolerance and multitolerance graphs. In spite of this progress, the complex"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.1543","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":"1412.1543","created_at":"2026-05-18T01:14:53.341227+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.1543v2","created_at":"2026-05-18T01:14:53.341227+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.1543","created_at":"2026-05-18T01:14:53.341227+00:00"},{"alias_kind":"pith_short_12","alias_value":"WA7PEPZG2QHA","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_16","alias_value":"WA7PEPZG2QHAO64L","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_8","alias_value":"WA7PEPZG","created_at":"2026-05-18T12:28:54.890064+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/WA7PEPZG2QHAO64LZQOKVYAZCI","json":"https://pith.science/pith/WA7PEPZG2QHAO64LZQOKVYAZCI.json","graph_json":"https://pith.science/api/pith-number/WA7PEPZG2QHAO64LZQOKVYAZCI/graph.json","events_json":"https://pith.science/api/pith-number/WA7PEPZG2QHAO64LZQOKVYAZCI/events.json","paper":"https://pith.science/paper/WA7PEPZG"},"agent_actions":{"view_html":"https://pith.science/pith/WA7PEPZG2QHAO64LZQOKVYAZCI","download_json":"https://pith.science/pith/WA7PEPZG2QHAO64LZQOKVYAZCI.json","view_paper":"https://pith.science/paper/WA7PEPZG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.1543&json=true","fetch_graph":"https://pith.science/api/pith-number/WA7PEPZG2QHAO64LZQOKVYAZCI/graph.json","fetch_events":"https://pith.science/api/pith-number/WA7PEPZG2QHAO64LZQOKVYAZCI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WA7PEPZG2QHAO64LZQOKVYAZCI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WA7PEPZG2QHAO64LZQOKVYAZCI/action/storage_attestation","attest_author":"https://pith.science/pith/WA7PEPZG2QHAO64LZQOKVYAZCI/action/author_attestation","sign_citation":"https://pith.science/pith/WA7PEPZG2QHAO64LZQOKVYAZCI/action/citation_signature","submit_replication":"https://pith.science/pith/WA7PEPZG2QHAO64LZQOKVYAZCI/action/replication_record"}},"created_at":"2026-05-18T01:14:53.341227+00:00","updated_at":"2026-05-18T01:14:53.341227+00:00"}