{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:DBTLGZG5UZ3TAU6CFCU5D5WT73","short_pith_number":"pith:DBTLGZG5","schema_version":"1.0","canonical_sha256":"1866b364dda6773053c228a9d1f6d3fee0f63d5aebc2b4ee3c838b0ce4975c4b","source":{"kind":"arxiv","id":"0911.3799","version":3},"attestation_state":"computed","paper":{"title":"Capturing Polynomial Time on Interval Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Bastian Laubner","submitted_at":"2009-11-19T14:29:45Z","abstract_excerpt":"We prove a characterization of all polynomial-time computable queries on the class of interval graphs by sentences of fixed-point logic with counting. More precisely, it is shown that on the class of unordered interval graphs, any query is polynomial-time computable if and only if it is definable in fixed-point logic with counting. This result is one of the first establishing the capturing of polynomial time on a graph class which is defined by forbidden induced subgraphs. For this, we define a canonical form of interval graphs using a type of modular decomposition, which is different from the"},"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":"0911.3799","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2009-11-19T14:29:45Z","cross_cats_sorted":[],"title_canon_sha256":"d344b8f7c1d592a080d499ddf92d7f3626161bb3a97d921e1148d48e9e6fb04a","abstract_canon_sha256":"33518e8988c7dda9ad20e891a8d1e3a8fae7eecd00be7165a0269eb828a96e2d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:31:42.257987Z","signature_b64":"HydciaGyXPredVX0fUYhYpJjb95fo7F6v4kFQdjJgC7oK1mlH2ry4dONW1Mq1Mb0YNxqwXD2F3m64ElDu0U0Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1866b364dda6773053c228a9d1f6d3fee0f63d5aebc2b4ee3c838b0ce4975c4b","last_reissued_at":"2026-05-18T04:31:42.257585Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:31:42.257585Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Capturing Polynomial Time on Interval Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Bastian Laubner","submitted_at":"2009-11-19T14:29:45Z","abstract_excerpt":"We prove a characterization of all polynomial-time computable queries on the class of interval graphs by sentences of fixed-point logic with counting. More precisely, it is shown that on the class of unordered interval graphs, any query is polynomial-time computable if and only if it is definable in fixed-point logic with counting. This result is one of the first establishing the capturing of polynomial time on a graph class which is defined by forbidden induced subgraphs. For this, we define a canonical form of interval graphs using a type of modular decomposition, which is different from the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0911.3799","kind":"arxiv","version":3},"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":"0911.3799","created_at":"2026-05-18T04:31:42.257651+00:00"},{"alias_kind":"arxiv_version","alias_value":"0911.3799v3","created_at":"2026-05-18T04:31:42.257651+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0911.3799","created_at":"2026-05-18T04:31:42.257651+00:00"},{"alias_kind":"pith_short_12","alias_value":"DBTLGZG5UZ3T","created_at":"2026-05-18T12:25:59.703012+00:00"},{"alias_kind":"pith_short_16","alias_value":"DBTLGZG5UZ3TAU6C","created_at":"2026-05-18T12:25:59.703012+00:00"},{"alias_kind":"pith_short_8","alias_value":"DBTLGZG5","created_at":"2026-05-18T12:25:59.703012+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/DBTLGZG5UZ3TAU6CFCU5D5WT73","json":"https://pith.science/pith/DBTLGZG5UZ3TAU6CFCU5D5WT73.json","graph_json":"https://pith.science/api/pith-number/DBTLGZG5UZ3TAU6CFCU5D5WT73/graph.json","events_json":"https://pith.science/api/pith-number/DBTLGZG5UZ3TAU6CFCU5D5WT73/events.json","paper":"https://pith.science/paper/DBTLGZG5"},"agent_actions":{"view_html":"https://pith.science/pith/DBTLGZG5UZ3TAU6CFCU5D5WT73","download_json":"https://pith.science/pith/DBTLGZG5UZ3TAU6CFCU5D5WT73.json","view_paper":"https://pith.science/paper/DBTLGZG5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0911.3799&json=true","fetch_graph":"https://pith.science/api/pith-number/DBTLGZG5UZ3TAU6CFCU5D5WT73/graph.json","fetch_events":"https://pith.science/api/pith-number/DBTLGZG5UZ3TAU6CFCU5D5WT73/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DBTLGZG5UZ3TAU6CFCU5D5WT73/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DBTLGZG5UZ3TAU6CFCU5D5WT73/action/storage_attestation","attest_author":"https://pith.science/pith/DBTLGZG5UZ3TAU6CFCU5D5WT73/action/author_attestation","sign_citation":"https://pith.science/pith/DBTLGZG5UZ3TAU6CFCU5D5WT73/action/citation_signature","submit_replication":"https://pith.science/pith/DBTLGZG5UZ3TAU6CFCU5D5WT73/action/replication_record"}},"created_at":"2026-05-18T04:31:42.257651+00:00","updated_at":"2026-05-18T04:31:42.257651+00:00"}