{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:EZET4JUZ3672CLZMZ3L7HVZORO","short_pith_number":"pith:EZET4JUZ","schema_version":"1.0","canonical_sha256":"26493e2699dfbfa12f2cced7f3d72e8baf24e5504a70313415f732bb44a18ec9","source":{"kind":"arxiv","id":"1908.03252","version":1},"attestation_state":"computed","paper":{"title":"On Symbolic Approaches for Computing the Matrix Permanent","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SC"],"primary_cat":"cs.DS","authors_text":"Aditya A. Shrotri, Moshe Y. Vardi, Supratik Chakraborty","submitted_at":"2019-08-08T20:01:59Z","abstract_excerpt":"Counting the number of perfect matchings in bipartite graphs, or equivalently computing the permanent of 0-1 matrices, is an important combinatorial problem that has been extensively studied by theoreticians and practitioners alike. The permanent is #P-Complete; hence it is unlikely that a polynomial-time algorithm exists for the problem. Researchers have therefore focused on finding tractable subclasses of matrices for permanent computation. One such subclass that has received much attention is that of sparse matrices i.e. matrices with few entries set to 1, the rest being 0. For this subclas"},"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":"1908.03252","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-08T20:01:59Z","cross_cats_sorted":["cs.SC"],"title_canon_sha256":"4a58b49484ab8ea64e8080a8b73e53e55a2d2d19678c8f0f38834bb16dd5a737","abstract_canon_sha256":"389ba8563e8ff14f795368e090c0fc5f3fef7900a154362abdb32a40844ed605"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:52:37.771420Z","signature_b64":"i1lQPDVN4a2TyF/JqZHV5YB7yxBwFaBzaaqG3a6XSSdW/zH7SgemAntj+jrlYowAWjHL1AyaPFY1oKaCfwFOBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"26493e2699dfbfa12f2cced7f3d72e8baf24e5504a70313415f732bb44a18ec9","last_reissued_at":"2026-07-04T23:52:37.770956Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:52:37.770956Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Symbolic Approaches for Computing the Matrix Permanent","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SC"],"primary_cat":"cs.DS","authors_text":"Aditya A. Shrotri, Moshe Y. Vardi, Supratik Chakraborty","submitted_at":"2019-08-08T20:01:59Z","abstract_excerpt":"Counting the number of perfect matchings in bipartite graphs, or equivalently computing the permanent of 0-1 matrices, is an important combinatorial problem that has been extensively studied by theoreticians and practitioners alike. The permanent is #P-Complete; hence it is unlikely that a polynomial-time algorithm exists for the problem. Researchers have therefore focused on finding tractable subclasses of matrices for permanent computation. One such subclass that has received much attention is that of sparse matrices i.e. matrices with few entries set to 1, the rest being 0. For this subclas"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.03252","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.03252/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1908.03252","created_at":"2026-07-04T23:52:37.771009+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.03252v1","created_at":"2026-07-04T23:52:37.771009+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.03252","created_at":"2026-07-04T23:52:37.771009+00:00"},{"alias_kind":"pith_short_12","alias_value":"EZET4JUZ3672","created_at":"2026-07-04T23:52:37.771009+00:00"},{"alias_kind":"pith_short_16","alias_value":"EZET4JUZ3672CLZM","created_at":"2026-07-04T23:52:37.771009+00:00"},{"alias_kind":"pith_short_8","alias_value":"EZET4JUZ","created_at":"2026-07-04T23:52:37.771009+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/EZET4JUZ3672CLZMZ3L7HVZORO","json":"https://pith.science/pith/EZET4JUZ3672CLZMZ3L7HVZORO.json","graph_json":"https://pith.science/api/pith-number/EZET4JUZ3672CLZMZ3L7HVZORO/graph.json","events_json":"https://pith.science/api/pith-number/EZET4JUZ3672CLZMZ3L7HVZORO/events.json","paper":"https://pith.science/paper/EZET4JUZ"},"agent_actions":{"view_html":"https://pith.science/pith/EZET4JUZ3672CLZMZ3L7HVZORO","download_json":"https://pith.science/pith/EZET4JUZ3672CLZMZ3L7HVZORO.json","view_paper":"https://pith.science/paper/EZET4JUZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.03252&json=true","fetch_graph":"https://pith.science/api/pith-number/EZET4JUZ3672CLZMZ3L7HVZORO/graph.json","fetch_events":"https://pith.science/api/pith-number/EZET4JUZ3672CLZMZ3L7HVZORO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EZET4JUZ3672CLZMZ3L7HVZORO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EZET4JUZ3672CLZMZ3L7HVZORO/action/storage_attestation","attest_author":"https://pith.science/pith/EZET4JUZ3672CLZMZ3L7HVZORO/action/author_attestation","sign_citation":"https://pith.science/pith/EZET4JUZ3672CLZMZ3L7HVZORO/action/citation_signature","submit_replication":"https://pith.science/pith/EZET4JUZ3672CLZMZ3L7HVZORO/action/replication_record"}},"created_at":"2026-07-04T23:52:37.771009+00:00","updated_at":"2026-07-04T23:52:37.771009+00:00"}