{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:JXUTYPLHDMUBWEIFRHLC66HMKG","short_pith_number":"pith:JXUTYPLH","schema_version":"1.0","canonical_sha256":"4de93c3d671b281b110589d62f78ec51bd878012ff828f0fc2b812ebe88c664d","source":{"kind":"arxiv","id":"1810.04670","version":1},"attestation_state":"computed","paper":{"title":"Algorithm for $\\mathcal{B}$-partitions, parameterized complexity of the matrix determinant and permanent","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Ranveer Singh, RB Bapat, Vivek Vijay","submitted_at":"2018-10-10T08:03:34Z","abstract_excerpt":"Every square matrix $A=(a_{uv})\\in \\mathcal{C}^{n\\times n}$ can be represented as a digraph having $n$ vertices. In the digraph, a block (or 2-connected component) is a maximally connected subdigraph that has no cut-vertex. The determinant and the permanent of a matrix can be calculated in terms of the determinant and the permanent of some specific induced subdigraphs of the blocks in the digraph. Interestingly, these induced subdigraphs are vertex-disjoint and they partition the digraph. Such partitions of the digraph are called the $\\mathcal{B}$-partitions. In this paper, first, we develop a"},"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":"1810.04670","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-10-10T08:03:34Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"f9a9ab80c1760aa6e060a00424e1508e7f18d69da50b48c817c80903c41b8bb0","abstract_canon_sha256":"9a0cf0ec17bdd4ba7d9de600f36bcdc04c74f2d6c151333c0518a10e9460dbe3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:36.197427Z","signature_b64":"2ST3eZLNEXiN9tcj4s5/xLhVvDn5S/Q+vv99TJ0giQoA41P7XRarnm+0dTS2cwOWq4UZmU3+gtYHIaE4+g1NCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4de93c3d671b281b110589d62f78ec51bd878012ff828f0fc2b812ebe88c664d","last_reissued_at":"2026-05-18T00:03:36.196760Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:36.196760Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Algorithm for $\\mathcal{B}$-partitions, parameterized complexity of the matrix determinant and permanent","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Ranveer Singh, RB Bapat, Vivek Vijay","submitted_at":"2018-10-10T08:03:34Z","abstract_excerpt":"Every square matrix $A=(a_{uv})\\in \\mathcal{C}^{n\\times n}$ can be represented as a digraph having $n$ vertices. In the digraph, a block (or 2-connected component) is a maximally connected subdigraph that has no cut-vertex. The determinant and the permanent of a matrix can be calculated in terms of the determinant and the permanent of some specific induced subdigraphs of the blocks in the digraph. Interestingly, these induced subdigraphs are vertex-disjoint and they partition the digraph. Such partitions of the digraph are called the $\\mathcal{B}$-partitions. In this paper, first, we develop a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.04670","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":"1810.04670","created_at":"2026-05-18T00:03:36.196867+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.04670v1","created_at":"2026-05-18T00:03:36.196867+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.04670","created_at":"2026-05-18T00:03:36.196867+00:00"},{"alias_kind":"pith_short_12","alias_value":"JXUTYPLHDMUB","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_16","alias_value":"JXUTYPLHDMUBWEIF","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_8","alias_value":"JXUTYPLH","created_at":"2026-05-18T12:32:33.847187+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/JXUTYPLHDMUBWEIFRHLC66HMKG","json":"https://pith.science/pith/JXUTYPLHDMUBWEIFRHLC66HMKG.json","graph_json":"https://pith.science/api/pith-number/JXUTYPLHDMUBWEIFRHLC66HMKG/graph.json","events_json":"https://pith.science/api/pith-number/JXUTYPLHDMUBWEIFRHLC66HMKG/events.json","paper":"https://pith.science/paper/JXUTYPLH"},"agent_actions":{"view_html":"https://pith.science/pith/JXUTYPLHDMUBWEIFRHLC66HMKG","download_json":"https://pith.science/pith/JXUTYPLHDMUBWEIFRHLC66HMKG.json","view_paper":"https://pith.science/paper/JXUTYPLH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.04670&json=true","fetch_graph":"https://pith.science/api/pith-number/JXUTYPLHDMUBWEIFRHLC66HMKG/graph.json","fetch_events":"https://pith.science/api/pith-number/JXUTYPLHDMUBWEIFRHLC66HMKG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JXUTYPLHDMUBWEIFRHLC66HMKG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JXUTYPLHDMUBWEIFRHLC66HMKG/action/storage_attestation","attest_author":"https://pith.science/pith/JXUTYPLHDMUBWEIFRHLC66HMKG/action/author_attestation","sign_citation":"https://pith.science/pith/JXUTYPLHDMUBWEIFRHLC66HMKG/action/citation_signature","submit_replication":"https://pith.science/pith/JXUTYPLHDMUBWEIFRHLC66HMKG/action/replication_record"}},"created_at":"2026-05-18T00:03:36.196867+00:00","updated_at":"2026-05-18T00:03:36.196867+00:00"}