{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:CAV35RYHFTSW67KNZERJQ42A7O","short_pith_number":"pith:CAV35RYH","schema_version":"1.0","canonical_sha256":"102bbec7072ce56f7d4dc922987340fbb0e2a123a6662449979df4e8a9560212","source":{"kind":"arxiv","id":"1312.7468","version":2},"attestation_state":"computed","paper":{"title":"Tree-width and Logspace: Determinants and Counting Euler Tours","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.CO"],"primary_cat":"cs.CC","authors_text":"Nikhil Balaji, Samir Datta","submitted_at":"2013-12-28T19:59:01Z","abstract_excerpt":"Motivated by the recent result of [EJT10] showing that MSO properties are Logspace computable on graphs of bounded tree-width, we consider the complexity of computing the determinant of the adjacency matrix of a bounded tree-width graph and prove that it is L-complete. It is important to notice that the determinant is neither an MSO-property nor counts the number of solutions of an MSO-predicate. We extend this technique to count the number of spanning arborescences and directed Euler tours in bounded tree-width digraphs, and further to counting the number of spanning trees and the number of E"},"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":"1312.7468","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-12-28T19:59:01Z","cross_cats_sorted":["cs.DS","math.CO"],"title_canon_sha256":"18d5dbab0e9809cef40bbfef120a1349f53cfa4fb328e881b32cfaee2a5ddbb1","abstract_canon_sha256":"915532663642d55e158c53d9156e337ecbb1d6d184087d6298589b0b24d7f7d9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:03:31.380979Z","signature_b64":"I/aNvuwkwJ2okPMJYf87+MaQ0kFYsK0s4PPU6n1yiEKoay1EJTIayddC5NICmM1HmRmi+Pt4H6p9BCQX9+RODA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"102bbec7072ce56f7d4dc922987340fbb0e2a123a6662449979df4e8a9560212","last_reissued_at":"2026-05-18T03:03:31.379596Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:03:31.379596Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tree-width and Logspace: Determinants and Counting Euler Tours","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.CO"],"primary_cat":"cs.CC","authors_text":"Nikhil Balaji, Samir Datta","submitted_at":"2013-12-28T19:59:01Z","abstract_excerpt":"Motivated by the recent result of [EJT10] showing that MSO properties are Logspace computable on graphs of bounded tree-width, we consider the complexity of computing the determinant of the adjacency matrix of a bounded tree-width graph and prove that it is L-complete. It is important to notice that the determinant is neither an MSO-property nor counts the number of solutions of an MSO-predicate. We extend this technique to count the number of spanning arborescences and directed Euler tours in bounded tree-width digraphs, and further to counting the number of spanning trees and the number of E"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.7468","kind":"arxiv","version":2},"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":"1312.7468","created_at":"2026-05-18T03:03:31.380042+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.7468v2","created_at":"2026-05-18T03:03:31.380042+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.7468","created_at":"2026-05-18T03:03:31.380042+00:00"},{"alias_kind":"pith_short_12","alias_value":"CAV35RYHFTSW","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_16","alias_value":"CAV35RYHFTSW67KN","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_8","alias_value":"CAV35RYH","created_at":"2026-05-18T12:27:40.988391+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/CAV35RYHFTSW67KNZERJQ42A7O","json":"https://pith.science/pith/CAV35RYHFTSW67KNZERJQ42A7O.json","graph_json":"https://pith.science/api/pith-number/CAV35RYHFTSW67KNZERJQ42A7O/graph.json","events_json":"https://pith.science/api/pith-number/CAV35RYHFTSW67KNZERJQ42A7O/events.json","paper":"https://pith.science/paper/CAV35RYH"},"agent_actions":{"view_html":"https://pith.science/pith/CAV35RYHFTSW67KNZERJQ42A7O","download_json":"https://pith.science/pith/CAV35RYHFTSW67KNZERJQ42A7O.json","view_paper":"https://pith.science/paper/CAV35RYH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.7468&json=true","fetch_graph":"https://pith.science/api/pith-number/CAV35RYHFTSW67KNZERJQ42A7O/graph.json","fetch_events":"https://pith.science/api/pith-number/CAV35RYHFTSW67KNZERJQ42A7O/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CAV35RYHFTSW67KNZERJQ42A7O/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CAV35RYHFTSW67KNZERJQ42A7O/action/storage_attestation","attest_author":"https://pith.science/pith/CAV35RYHFTSW67KNZERJQ42A7O/action/author_attestation","sign_citation":"https://pith.science/pith/CAV35RYHFTSW67KNZERJQ42A7O/action/citation_signature","submit_replication":"https://pith.science/pith/CAV35RYHFTSW67KNZERJQ42A7O/action/replication_record"}},"created_at":"2026-05-18T03:03:31.380042+00:00","updated_at":"2026-05-18T03:03:31.380042+00:00"}