{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:WUMTSXPC6YFBDWWKFNMRDHA5VB","short_pith_number":"pith:WUMTSXPC","schema_version":"1.0","canonical_sha256":"b519395de2f60a11daca2b59119c1da8659130cfba67809c2163705e5881b637","source":{"kind":"arxiv","id":"1108.5457","version":1},"attestation_state":"computed","paper":{"title":"Deciding first order logic properties of matroids","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.LO"],"primary_cat":"cs.DS","authors_text":"Daniel Kral, Sang-il Oum, Tomas Gavenciak","submitted_at":"2011-08-27T15:02:37Z","abstract_excerpt":"Frick and Grohe [J. ACM 48 (2006), 1184-1206] introduced a notion of graph classes with locally bounded tree-width and established that every first order logic property can be decided in almost linear time in such a graph class. Here, we introduce an analogous notion for matroids (locally bounded branch-width) and show the existence of a fixed parameter algorithm for first order logic properties in classes of regular matroids with locally bounded branch-width. To obtain this result, we show that the problem of deciding the existence of a circuit of length at most k containing two given element"},"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":"1108.5457","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-08-27T15:02:37Z","cross_cats_sorted":["cs.DM","cs.LO"],"title_canon_sha256":"3460cabd6fe639a5004cf43de83f601ccb9799ea6c277120205ebc5250bc871d","abstract_canon_sha256":"1b3001aae595bcc2015421f9a7e9807088e2e9b8a19e979ac63bc9042066ec34"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:14:37.476887Z","signature_b64":"DjbcDFCaT+e45iaWivZHAMCJdJZjhLcl1DgZd/hBgHemSzQdDlpMBsKcPLGRe1V4X58F8WZmLL/8PZprhiMeCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b519395de2f60a11daca2b59119c1da8659130cfba67809c2163705e5881b637","last_reissued_at":"2026-05-18T04:14:37.476505Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:14:37.476505Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deciding first order logic properties of matroids","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.LO"],"primary_cat":"cs.DS","authors_text":"Daniel Kral, Sang-il Oum, Tomas Gavenciak","submitted_at":"2011-08-27T15:02:37Z","abstract_excerpt":"Frick and Grohe [J. ACM 48 (2006), 1184-1206] introduced a notion of graph classes with locally bounded tree-width and established that every first order logic property can be decided in almost linear time in such a graph class. Here, we introduce an analogous notion for matroids (locally bounded branch-width) and show the existence of a fixed parameter algorithm for first order logic properties in classes of regular matroids with locally bounded branch-width. To obtain this result, we show that the problem of deciding the existence of a circuit of length at most k containing two given element"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.5457","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":"1108.5457","created_at":"2026-05-18T04:14:37.476552+00:00"},{"alias_kind":"arxiv_version","alias_value":"1108.5457v1","created_at":"2026-05-18T04:14:37.476552+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.5457","created_at":"2026-05-18T04:14:37.476552+00:00"},{"alias_kind":"pith_short_12","alias_value":"WUMTSXPC6YFB","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_16","alias_value":"WUMTSXPC6YFBDWWK","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_8","alias_value":"WUMTSXPC","created_at":"2026-05-18T12:26:44.992195+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/WUMTSXPC6YFBDWWKFNMRDHA5VB","json":"https://pith.science/pith/WUMTSXPC6YFBDWWKFNMRDHA5VB.json","graph_json":"https://pith.science/api/pith-number/WUMTSXPC6YFBDWWKFNMRDHA5VB/graph.json","events_json":"https://pith.science/api/pith-number/WUMTSXPC6YFBDWWKFNMRDHA5VB/events.json","paper":"https://pith.science/paper/WUMTSXPC"},"agent_actions":{"view_html":"https://pith.science/pith/WUMTSXPC6YFBDWWKFNMRDHA5VB","download_json":"https://pith.science/pith/WUMTSXPC6YFBDWWKFNMRDHA5VB.json","view_paper":"https://pith.science/paper/WUMTSXPC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1108.5457&json=true","fetch_graph":"https://pith.science/api/pith-number/WUMTSXPC6YFBDWWKFNMRDHA5VB/graph.json","fetch_events":"https://pith.science/api/pith-number/WUMTSXPC6YFBDWWKFNMRDHA5VB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WUMTSXPC6YFBDWWKFNMRDHA5VB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WUMTSXPC6YFBDWWKFNMRDHA5VB/action/storage_attestation","attest_author":"https://pith.science/pith/WUMTSXPC6YFBDWWKFNMRDHA5VB/action/author_attestation","sign_citation":"https://pith.science/pith/WUMTSXPC6YFBDWWKFNMRDHA5VB/action/citation_signature","submit_replication":"https://pith.science/pith/WUMTSXPC6YFBDWWKFNMRDHA5VB/action/replication_record"}},"created_at":"2026-05-18T04:14:37.476552+00:00","updated_at":"2026-05-18T04:14:37.476552+00:00"}