{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:IEMEMLY7BO2QAVTAXQJPM5F4US","short_pith_number":"pith:IEMEMLY7","schema_version":"1.0","canonical_sha256":"4118462f1f0bb5005660bc12f674bca486a88ab2a5d0b92ed5c91dc1da839161","source":{"kind":"arxiv","id":"1004.1485","version":1},"attestation_state":"computed","paper":{"title":"Are there any good digraph width measures?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DM","authors_text":"Daniel Meister, Jan Obdr\\v{z}\\'alek, Joachim Kneis, Peter Rossmanith, Petr Hlin\\v{e}n\\'y, Robert Ganian, Somnath Sikdar","submitted_at":"2010-04-09T07:50:34Z","abstract_excerpt":"Several different measures for digraph width have appeared in the last few years. However, none of them shares all the \"nice\" properties of treewidth: First, being \\emph{algorithmically useful} i.e. admitting polynomial-time algorithms for all $\\MS1$-definable problems on digraphs of bounded width. And, second, having nice \\emph{structural properties} i.e. being monotone under taking subdigraphs and some form of arc contractions. As for the former, (undirected) $\\MS1$ seems to be the least common denominator of all reasonably expressive logical languages on digraphs that can speak about the ed"},"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":"1004.1485","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2010-04-09T07:50:34Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"e2ee25355cdccbc641c2e5a3747b6f8fe1ce6d7180192094e990bbcfccfb2d2d","abstract_canon_sha256":"7ca191f7c39be14476ba290531aa1674520a6122e87b834d04d5b62e98823d00"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:24.087485Z","signature_b64":"oTgMaxQcp/tZIlMIqCg0k5kXfm1pgSHhHlElCqOtBvHcvBbjOji2xpIOKF2h5giPoVncyANk5+bv2A0lGGIoDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4118462f1f0bb5005660bc12f674bca486a88ab2a5d0b92ed5c91dc1da839161","last_reissued_at":"2026-05-18T01:09:24.086846Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:24.086846Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Are there any good digraph width measures?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DM","authors_text":"Daniel Meister, Jan Obdr\\v{z}\\'alek, Joachim Kneis, Peter Rossmanith, Petr Hlin\\v{e}n\\'y, Robert Ganian, Somnath Sikdar","submitted_at":"2010-04-09T07:50:34Z","abstract_excerpt":"Several different measures for digraph width have appeared in the last few years. However, none of them shares all the \"nice\" properties of treewidth: First, being \\emph{algorithmically useful} i.e. admitting polynomial-time algorithms for all $\\MS1$-definable problems on digraphs of bounded width. And, second, having nice \\emph{structural properties} i.e. being monotone under taking subdigraphs and some form of arc contractions. As for the former, (undirected) $\\MS1$ seems to be the least common denominator of all reasonably expressive logical languages on digraphs that can speak about the ed"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1004.1485","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":"1004.1485","created_at":"2026-05-18T01:09:24.086935+00:00"},{"alias_kind":"arxiv_version","alias_value":"1004.1485v1","created_at":"2026-05-18T01:09:24.086935+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1004.1485","created_at":"2026-05-18T01:09:24.086935+00:00"},{"alias_kind":"pith_short_12","alias_value":"IEMEMLY7BO2Q","created_at":"2026-05-18T12:26:09.077623+00:00"},{"alias_kind":"pith_short_16","alias_value":"IEMEMLY7BO2QAVTA","created_at":"2026-05-18T12:26:09.077623+00:00"},{"alias_kind":"pith_short_8","alias_value":"IEMEMLY7","created_at":"2026-05-18T12:26:09.077623+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/IEMEMLY7BO2QAVTAXQJPM5F4US","json":"https://pith.science/pith/IEMEMLY7BO2QAVTAXQJPM5F4US.json","graph_json":"https://pith.science/api/pith-number/IEMEMLY7BO2QAVTAXQJPM5F4US/graph.json","events_json":"https://pith.science/api/pith-number/IEMEMLY7BO2QAVTAXQJPM5F4US/events.json","paper":"https://pith.science/paper/IEMEMLY7"},"agent_actions":{"view_html":"https://pith.science/pith/IEMEMLY7BO2QAVTAXQJPM5F4US","download_json":"https://pith.science/pith/IEMEMLY7BO2QAVTAXQJPM5F4US.json","view_paper":"https://pith.science/paper/IEMEMLY7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1004.1485&json=true","fetch_graph":"https://pith.science/api/pith-number/IEMEMLY7BO2QAVTAXQJPM5F4US/graph.json","fetch_events":"https://pith.science/api/pith-number/IEMEMLY7BO2QAVTAXQJPM5F4US/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IEMEMLY7BO2QAVTAXQJPM5F4US/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IEMEMLY7BO2QAVTAXQJPM5F4US/action/storage_attestation","attest_author":"https://pith.science/pith/IEMEMLY7BO2QAVTAXQJPM5F4US/action/author_attestation","sign_citation":"https://pith.science/pith/IEMEMLY7BO2QAVTAXQJPM5F4US/action/citation_signature","submit_replication":"https://pith.science/pith/IEMEMLY7BO2QAVTAXQJPM5F4US/action/replication_record"}},"created_at":"2026-05-18T01:09:24.086935+00:00","updated_at":"2026-05-18T01:09:24.086935+00:00"}