{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:CAV35RYHFTSW67KNZERJQ42A7O","short_pith_number":"pith:CAV35RYH","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"},"canonical_sha256":"102bbec7072ce56f7d4dc922987340fbb0e2a123a6662449979df4e8a9560212","source":{"kind":"arxiv","id":"1312.7468","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.7468","created_at":"2026-05-18T03:03:31Z"},{"alias_kind":"arxiv_version","alias_value":"1312.7468v2","created_at":"2026-05-18T03:03:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.7468","created_at":"2026-05-18T03:03:31Z"},{"alias_kind":"pith_short_12","alias_value":"CAV35RYHFTSW","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"CAV35RYHFTSW67KN","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"CAV35RYH","created_at":"2026-05-18T12:27:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:CAV35RYHFTSW67KNZERJQ42A7O","target":"record","payload":{"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"},"canonical_sha256":"102bbec7072ce56f7d4dc922987340fbb0e2a123a6662449979df4e8a9560212","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"},"source_kind":"arxiv","source_id":"1312.7468","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:03:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z/xcen5Yf/huMABYMlMpWR8SVy0D5qYO92LTyxp894b0PJtAegY1CxSkQLSOVq5pnbI8n2y84juWrWh35qIsAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T12:45:37.248631Z"},"content_sha256":"cfb947e7ad92e15be3c753e1b8d8c1a02fdb26fcab92cdaad1bdbb1ed7b9c10d","schema_version":"1.0","event_id":"sha256:cfb947e7ad92e15be3c753e1b8d8c1a02fdb26fcab92cdaad1bdbb1ed7b9c10d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:CAV35RYHFTSW67KNZERJQ42A7O","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:03:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zCMcq/c8BGQZLTurBqjNmssx3PfgMFCbOrQpVgTlRfsGBL625PKk06CcQojb32H41mptLPYLAkd5uYZf1OB/BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T12:45:37.248982Z"},"content_sha256":"11f29da4e809f3e20da3f6bce22ee87f5774c2e03cb82615b3eddc6515c73687","schema_version":"1.0","event_id":"sha256:11f29da4e809f3e20da3f6bce22ee87f5774c2e03cb82615b3eddc6515c73687"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CAV35RYHFTSW67KNZERJQ42A7O/bundle.json","state_url":"https://pith.science/pith/CAV35RYHFTSW67KNZERJQ42A7O/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CAV35RYHFTSW67KNZERJQ42A7O/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-03T12:45:37Z","links":{"resolver":"https://pith.science/pith/CAV35RYHFTSW67KNZERJQ42A7O","bundle":"https://pith.science/pith/CAV35RYHFTSW67KNZERJQ42A7O/bundle.json","state":"https://pith.science/pith/CAV35RYHFTSW67KNZERJQ42A7O/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CAV35RYHFTSW67KNZERJQ42A7O/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:CAV35RYHFTSW67KNZERJQ42A7O","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"915532663642d55e158c53d9156e337ecbb1d6d184087d6298589b0b24d7f7d9","cross_cats_sorted":["cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-12-28T19:59:01Z","title_canon_sha256":"18d5dbab0e9809cef40bbfef120a1349f53cfa4fb328e881b32cfaee2a5ddbb1"},"schema_version":"1.0","source":{"id":"1312.7468","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.7468","created_at":"2026-05-18T03:03:31Z"},{"alias_kind":"arxiv_version","alias_value":"1312.7468v2","created_at":"2026-05-18T03:03:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.7468","created_at":"2026-05-18T03:03:31Z"},{"alias_kind":"pith_short_12","alias_value":"CAV35RYHFTSW","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"CAV35RYHFTSW67KN","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"CAV35RYH","created_at":"2026-05-18T12:27:40Z"}],"graph_snapshots":[{"event_id":"sha256:11f29da4e809f3e20da3f6bce22ee87f5774c2e03cb82615b3eddc6515c73687","target":"graph","created_at":"2026-05-18T03:03:31Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Nikhil Balaji, Samir Datta","cross_cats":["cs.DS","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-12-28T19:59:01Z","title":"Tree-width and Logspace: Determinants and Counting Euler Tours"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.7468","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:cfb947e7ad92e15be3c753e1b8d8c1a02fdb26fcab92cdaad1bdbb1ed7b9c10d","target":"record","created_at":"2026-05-18T03:03:31Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"915532663642d55e158c53d9156e337ecbb1d6d184087d6298589b0b24d7f7d9","cross_cats_sorted":["cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-12-28T19:59:01Z","title_canon_sha256":"18d5dbab0e9809cef40bbfef120a1349f53cfa4fb328e881b32cfaee2a5ddbb1"},"schema_version":"1.0","source":{"id":"1312.7468","kind":"arxiv","version":2}},"canonical_sha256":"102bbec7072ce56f7d4dc922987340fbb0e2a123a6662449979df4e8a9560212","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"102bbec7072ce56f7d4dc922987340fbb0e2a123a6662449979df4e8a9560212","first_computed_at":"2026-05-18T03:03:31.379596Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:03:31.379596Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"I/aNvuwkwJ2okPMJYf87+MaQ0kFYsK0s4PPU6n1yiEKoay1EJTIayddC5NICmM1HmRmi+Pt4H6p9BCQX9+RODA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:03:31.380979Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.7468","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cfb947e7ad92e15be3c753e1b8d8c1a02fdb26fcab92cdaad1bdbb1ed7b9c10d","sha256:11f29da4e809f3e20da3f6bce22ee87f5774c2e03cb82615b3eddc6515c73687"],"state_sha256":"826dd09228d74aa1dad77c41396ce444460acc80b98eb9f738cc226a634a9238"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hVDTmTRywucyEI09fN6oQJZK5H/IN+G2/n0ugV+W1d4kACbvuQUFaB9cQ5d5ApimJtFgnWGWcUg1xoLpxXB2CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T12:45:37.251092Z","bundle_sha256":"248b3f800a04f27cbd49b45ec1c792d2bbbee0b6ddd2b6991f45dfb5294094fc"}}