{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:OCOCEJRBD63QNGCTPSIVKTY2B7","short_pith_number":"pith:OCOCEJRB","schema_version":"1.0","canonical_sha256":"709c2226211fb70698537c91554f1a0fc9255c9900231f06daa4d42580beef34","source":{"kind":"arxiv","id":"1607.05516","version":1},"attestation_state":"computed","paper":{"title":"Spanning Circuits in Regular Matroids","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Daniel Lokshtanov, Fedor V. Fomin, Petr A. Golovach, Saket Saurabh","submitted_at":"2016-07-19T11:01:35Z","abstract_excerpt":"We consider the fundamental Matroid Theory problem of finding a circuit in a matroid spanning a set T of given terminal elements. For graphic matroids this corresponds to the problem of finding a simple cycle passing through a set of given terminal edges in a graph. The algorithmic study of the problem on regular matroids, a superclass of graphic matroids, was initiated by Gaven\\v{c}iak, Kr\\'al', and Oum [ICALP'12], who proved that the case of the problem with |T|=2 is fixed-parameter tractable (FPT) when parameterized by the length of the circuit. We extend the result of Gaven\\v{c}iak, Kr\\'al"},"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":"1607.05516","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-19T11:01:35Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"082f9826f17753fdad017be69b7dc13eef10eff25ff65b4ad32cdb4fcc3d56b3","abstract_canon_sha256":"92e7153208381356a231fd71a5c90773078f9b6e5d15f65c9323e66f8c7e209f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:46.666926Z","signature_b64":"+hQ/f7HxeVmI79tUDe4lc8SevOey6kcr8AMmP0bzJGjGDF8glXD6+PSl6ly2H5n/OtieFmBsJfH9fj5D4JhiCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"709c2226211fb70698537c91554f1a0fc9255c9900231f06daa4d42580beef34","last_reissued_at":"2026-05-18T01:10:46.666429Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:46.666429Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Spanning Circuits in Regular Matroids","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Daniel Lokshtanov, Fedor V. Fomin, Petr A. Golovach, Saket Saurabh","submitted_at":"2016-07-19T11:01:35Z","abstract_excerpt":"We consider the fundamental Matroid Theory problem of finding a circuit in a matroid spanning a set T of given terminal elements. For graphic matroids this corresponds to the problem of finding a simple cycle passing through a set of given terminal edges in a graph. The algorithmic study of the problem on regular matroids, a superclass of graphic matroids, was initiated by Gaven\\v{c}iak, Kr\\'al', and Oum [ICALP'12], who proved that the case of the problem with |T|=2 is fixed-parameter tractable (FPT) when parameterized by the length of the circuit. We extend the result of Gaven\\v{c}iak, Kr\\'al"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.05516","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":"1607.05516","created_at":"2026-05-18T01:10:46.666506+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.05516v1","created_at":"2026-05-18T01:10:46.666506+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.05516","created_at":"2026-05-18T01:10:46.666506+00:00"},{"alias_kind":"pith_short_12","alias_value":"OCOCEJRBD63Q","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_16","alias_value":"OCOCEJRBD63QNGCT","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_8","alias_value":"OCOCEJRB","created_at":"2026-05-18T12:30:36.002864+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/OCOCEJRBD63QNGCTPSIVKTY2B7","json":"https://pith.science/pith/OCOCEJRBD63QNGCTPSIVKTY2B7.json","graph_json":"https://pith.science/api/pith-number/OCOCEJRBD63QNGCTPSIVKTY2B7/graph.json","events_json":"https://pith.science/api/pith-number/OCOCEJRBD63QNGCTPSIVKTY2B7/events.json","paper":"https://pith.science/paper/OCOCEJRB"},"agent_actions":{"view_html":"https://pith.science/pith/OCOCEJRBD63QNGCTPSIVKTY2B7","download_json":"https://pith.science/pith/OCOCEJRBD63QNGCTPSIVKTY2B7.json","view_paper":"https://pith.science/paper/OCOCEJRB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.05516&json=true","fetch_graph":"https://pith.science/api/pith-number/OCOCEJRBD63QNGCTPSIVKTY2B7/graph.json","fetch_events":"https://pith.science/api/pith-number/OCOCEJRBD63QNGCTPSIVKTY2B7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OCOCEJRBD63QNGCTPSIVKTY2B7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OCOCEJRBD63QNGCTPSIVKTY2B7/action/storage_attestation","attest_author":"https://pith.science/pith/OCOCEJRBD63QNGCTPSIVKTY2B7/action/author_attestation","sign_citation":"https://pith.science/pith/OCOCEJRBD63QNGCTPSIVKTY2B7/action/citation_signature","submit_replication":"https://pith.science/pith/OCOCEJRBD63QNGCTPSIVKTY2B7/action/replication_record"}},"created_at":"2026-05-18T01:10:46.666506+00:00","updated_at":"2026-05-18T01:10:46.666506+00:00"}