{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:LWJIJNZH5GROCMACAJV2EERP4V","short_pith_number":"pith:LWJIJNZH","schema_version":"1.0","canonical_sha256":"5d9284b727e9a2e13002026ba2122fe55fc2dcdc39e33cd92ef041cf15ad9cdc","source":{"kind":"arxiv","id":"2309.11908","version":1},"attestation_state":"computed","paper":{"title":"Recognizing unit multiple intervals is hard","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Florian Sikora, Romeo Rizzi, St\\'ephane Vialette, Virginia Ard\\'evol Mart\\'inez","submitted_at":"2023-09-21T09:18:00Z","abstract_excerpt":"Multiple interval graphs are a well-known generalization of interval graphs introduced in the 1970s to deal with situations arising naturally in scheduling and allocation. A $d$-interval is the union of $d$ intervals on the real line, and a graph is a $d$-interval graph if it is the intersection graph of $d$-intervals. In particular, it is a unit $d$-interval graph if it admits a $d$-interval representation where every interval has unit length.\n  Whereas it has been known for a long time that recognizing 2-interval graphs and other related classes such as 2-track interval graphs is NP-complete"},"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":"2309.11908","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2023-09-21T09:18:00Z","cross_cats_sorted":[],"title_canon_sha256":"d88050d72374551834ab44530a7238d2959776999f432411f2d227f5ebcaf338","abstract_canon_sha256":"5afd54844f94662b75580f5c19aafd3680543f6b21c9c6833adb15082f7952e1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:52:56.103515Z","signature_b64":"j3eJ580V4GQdEo5kxJ16uGAB8V1CBSFhKnDeSt5hRPVAvX2cupg+JzsUXtcWUf1sg6usr1CigANOncBHg4+TAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5d9284b727e9a2e13002026ba2122fe55fc2dcdc39e33cd92ef041cf15ad9cdc","last_reissued_at":"2026-07-05T06:52:56.103014Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:52:56.103014Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Recognizing unit multiple intervals is hard","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Florian Sikora, Romeo Rizzi, St\\'ephane Vialette, Virginia Ard\\'evol Mart\\'inez","submitted_at":"2023-09-21T09:18:00Z","abstract_excerpt":"Multiple interval graphs are a well-known generalization of interval graphs introduced in the 1970s to deal with situations arising naturally in scheduling and allocation. A $d$-interval is the union of $d$ intervals on the real line, and a graph is a $d$-interval graph if it is the intersection graph of $d$-intervals. In particular, it is a unit $d$-interval graph if it admits a $d$-interval representation where every interval has unit length.\n  Whereas it has been known for a long time that recognizing 2-interval graphs and other related classes such as 2-track interval graphs is NP-complete"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.11908","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2309.11908/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2309.11908","created_at":"2026-07-05T06:52:56.103073+00:00"},{"alias_kind":"arxiv_version","alias_value":"2309.11908v1","created_at":"2026-07-05T06:52:56.103073+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.11908","created_at":"2026-07-05T06:52:56.103073+00:00"},{"alias_kind":"pith_short_12","alias_value":"LWJIJNZH5GRO","created_at":"2026-07-05T06:52:56.103073+00:00"},{"alias_kind":"pith_short_16","alias_value":"LWJIJNZH5GROCMAC","created_at":"2026-07-05T06:52:56.103073+00:00"},{"alias_kind":"pith_short_8","alias_value":"LWJIJNZH","created_at":"2026-07-05T06:52:56.103073+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/LWJIJNZH5GROCMACAJV2EERP4V","json":"https://pith.science/pith/LWJIJNZH5GROCMACAJV2EERP4V.json","graph_json":"https://pith.science/api/pith-number/LWJIJNZH5GROCMACAJV2EERP4V/graph.json","events_json":"https://pith.science/api/pith-number/LWJIJNZH5GROCMACAJV2EERP4V/events.json","paper":"https://pith.science/paper/LWJIJNZH"},"agent_actions":{"view_html":"https://pith.science/pith/LWJIJNZH5GROCMACAJV2EERP4V","download_json":"https://pith.science/pith/LWJIJNZH5GROCMACAJV2EERP4V.json","view_paper":"https://pith.science/paper/LWJIJNZH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2309.11908&json=true","fetch_graph":"https://pith.science/api/pith-number/LWJIJNZH5GROCMACAJV2EERP4V/graph.json","fetch_events":"https://pith.science/api/pith-number/LWJIJNZH5GROCMACAJV2EERP4V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LWJIJNZH5GROCMACAJV2EERP4V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LWJIJNZH5GROCMACAJV2EERP4V/action/storage_attestation","attest_author":"https://pith.science/pith/LWJIJNZH5GROCMACAJV2EERP4V/action/author_attestation","sign_citation":"https://pith.science/pith/LWJIJNZH5GROCMACAJV2EERP4V/action/citation_signature","submit_replication":"https://pith.science/pith/LWJIJNZH5GROCMACAJV2EERP4V/action/replication_record"}},"created_at":"2026-07-05T06:52:56.103073+00:00","updated_at":"2026-07-05T06:52:56.103073+00:00"}