{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2007:Z3PWQZV4ZI2ZZ6SEGQOYZG74G3","short_pith_number":"pith:Z3PWQZV4","schema_version":"1.0","canonical_sha256":"cedf6866bcca359cfa44341d8c9bfc36cebd73a3c1e12ea002b4544d845a4072","source":{"kind":"arxiv","id":"0705.4548","version":3},"attestation_state":"computed","paper":{"title":"A permanent formula for the Jones polynomial","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","quant-ph"],"primary_cat":"math.QA","authors_text":"Iain Moffatt, Martin Loebl","submitted_at":"2007-05-31T09:15:15Z","abstract_excerpt":"The permanent of a square matrix is defined in a way similar to the determinant, but without using signs. The exact computation of the permanent is hard, but there are Monte-Carlo algorithms that can estimate general permanents. Given a planar diagram of a link L with $n$ crossings, we define a 7n by 7n matrix whose permanent equals to the Jones polynomial of L. This result accompanied with recent work of Freedman, Kitaev, Larson and Wang provides a Monte-Carlo algorithm to any decision problem belonging to the class BQP, i.e. such that it can be computed with bounded error in polynomial time "},"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":"0705.4548","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.QA","submitted_at":"2007-05-31T09:15:15Z","cross_cats_sorted":["math.CO","quant-ph"],"title_canon_sha256":"244574e082b79ca8ab4ffe8bc271997d860d53ffe00daabdb99b190c4b621832","abstract_canon_sha256":"151469d35eb127d5702d476250b97ccabbf92f0940b4b57c2338efcfad142494"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:01:13.548782Z","signature_b64":"o4Wo4ImY8ts/hrRBqzLxNTQabvM6qUP0UXM94bDzCnO4miuS9tgVkwaXZnd78XvQqhTOawhuzFuPsnVDbTCSCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cedf6866bcca359cfa44341d8c9bfc36cebd73a3c1e12ea002b4544d845a4072","last_reissued_at":"2026-05-18T04:01:13.548215Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:01:13.548215Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A permanent formula for the Jones polynomial","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","quant-ph"],"primary_cat":"math.QA","authors_text":"Iain Moffatt, Martin Loebl","submitted_at":"2007-05-31T09:15:15Z","abstract_excerpt":"The permanent of a square matrix is defined in a way similar to the determinant, but without using signs. The exact computation of the permanent is hard, but there are Monte-Carlo algorithms that can estimate general permanents. Given a planar diagram of a link L with $n$ crossings, we define a 7n by 7n matrix whose permanent equals to the Jones polynomial of L. This result accompanied with recent work of Freedman, Kitaev, Larson and Wang provides a Monte-Carlo algorithm to any decision problem belonging to the class BQP, i.e. such that it can be computed with bounded error in polynomial time "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0705.4548","kind":"arxiv","version":3},"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":"0705.4548","created_at":"2026-05-18T04:01:13.548306+00:00"},{"alias_kind":"arxiv_version","alias_value":"0705.4548v3","created_at":"2026-05-18T04:01:13.548306+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0705.4548","created_at":"2026-05-18T04:01:13.548306+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z3PWQZV4ZI2Z","created_at":"2026-05-18T12:25:56.245647+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z3PWQZV4ZI2ZZ6SE","created_at":"2026-05-18T12:25:56.245647+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z3PWQZV4","created_at":"2026-05-18T12:25:56.245647+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/Z3PWQZV4ZI2ZZ6SEGQOYZG74G3","json":"https://pith.science/pith/Z3PWQZV4ZI2ZZ6SEGQOYZG74G3.json","graph_json":"https://pith.science/api/pith-number/Z3PWQZV4ZI2ZZ6SEGQOYZG74G3/graph.json","events_json":"https://pith.science/api/pith-number/Z3PWQZV4ZI2ZZ6SEGQOYZG74G3/events.json","paper":"https://pith.science/paper/Z3PWQZV4"},"agent_actions":{"view_html":"https://pith.science/pith/Z3PWQZV4ZI2ZZ6SEGQOYZG74G3","download_json":"https://pith.science/pith/Z3PWQZV4ZI2ZZ6SEGQOYZG74G3.json","view_paper":"https://pith.science/paper/Z3PWQZV4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0705.4548&json=true","fetch_graph":"https://pith.science/api/pith-number/Z3PWQZV4ZI2ZZ6SEGQOYZG74G3/graph.json","fetch_events":"https://pith.science/api/pith-number/Z3PWQZV4ZI2ZZ6SEGQOYZG74G3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z3PWQZV4ZI2ZZ6SEGQOYZG74G3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z3PWQZV4ZI2ZZ6SEGQOYZG74G3/action/storage_attestation","attest_author":"https://pith.science/pith/Z3PWQZV4ZI2ZZ6SEGQOYZG74G3/action/author_attestation","sign_citation":"https://pith.science/pith/Z3PWQZV4ZI2ZZ6SEGQOYZG74G3/action/citation_signature","submit_replication":"https://pith.science/pith/Z3PWQZV4ZI2ZZ6SEGQOYZG74G3/action/replication_record"}},"created_at":"2026-05-18T04:01:13.548306+00:00","updated_at":"2026-05-18T04:01:13.548306+00:00"}