{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:ZUHVGFGZ3CGOGT23NKXHZQOIV3","short_pith_number":"pith:ZUHVGFGZ","schema_version":"1.0","canonical_sha256":"cd0f5314d9d88ce34f5b6aae7cc1c8aec83ce8846f8186bdbb410278bd4afa15","source":{"kind":"arxiv","id":"1507.03046","version":1},"attestation_state":"computed","paper":{"title":"An efficient tree decomposition method for permanents and mixed discriminants","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS"],"primary_cat":"cs.DM","authors_text":"Diego Cifuentes, Pablo A. Parrilo","submitted_at":"2015-07-10T23:26:53Z","abstract_excerpt":"We present an efficient algorithm to compute permanents, mixed discriminants and hyperdeterminants of structured matrices and multidimensional arrays (tensors). We describe the sparsity structure of an array in terms of a graph, and we assume that its treewidth, denoted as $\\omega$, is small. Our algorithm requires $O(n 2^\\omega)$ arithmetic operations to compute permanents, and $O(n^2 + n 3^\\omega)$ for mixed discriminants and hyperdeterminants. We finally show that mixed volume computation continues to be hard under bounded treewidth assumptions."},"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":"1507.03046","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-07-10T23:26:53Z","cross_cats_sorted":["cs.CC","cs.DS"],"title_canon_sha256":"8d861ab355e198dd814c2bfbdc06f9a2f4da684be40fe0147f71a5615116e35c","abstract_canon_sha256":"380ca852ddb359316fb8e7eaf6672ce3eb2d1f8167f0d4e6aa547e1f9b47b79d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:52.729387Z","signature_b64":"VyIqYBz8A+l5hpI4Y6G3qcdfb8ohw/o9+oropUijVdFbhdJc1gmK0Z1uNHBub781cT13irLVMkGrgDYhiebuAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cd0f5314d9d88ce34f5b6aae7cc1c8aec83ce8846f8186bdbb410278bd4afa15","last_reissued_at":"2026-05-18T01:17:52.728671Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:52.728671Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An efficient tree decomposition method for permanents and mixed discriminants","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS"],"primary_cat":"cs.DM","authors_text":"Diego Cifuentes, Pablo A. Parrilo","submitted_at":"2015-07-10T23:26:53Z","abstract_excerpt":"We present an efficient algorithm to compute permanents, mixed discriminants and hyperdeterminants of structured matrices and multidimensional arrays (tensors). We describe the sparsity structure of an array in terms of a graph, and we assume that its treewidth, denoted as $\\omega$, is small. Our algorithm requires $O(n 2^\\omega)$ arithmetic operations to compute permanents, and $O(n^2 + n 3^\\omega)$ for mixed discriminants and hyperdeterminants. We finally show that mixed volume computation continues to be hard under bounded treewidth assumptions."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.03046","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":"1507.03046","created_at":"2026-05-18T01:17:52.728780+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.03046v1","created_at":"2026-05-18T01:17:52.728780+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.03046","created_at":"2026-05-18T01:17:52.728780+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZUHVGFGZ3CGO","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZUHVGFGZ3CGOGT23","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZUHVGFGZ","created_at":"2026-05-18T12:29:52.810259+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/ZUHVGFGZ3CGOGT23NKXHZQOIV3","json":"https://pith.science/pith/ZUHVGFGZ3CGOGT23NKXHZQOIV3.json","graph_json":"https://pith.science/api/pith-number/ZUHVGFGZ3CGOGT23NKXHZQOIV3/graph.json","events_json":"https://pith.science/api/pith-number/ZUHVGFGZ3CGOGT23NKXHZQOIV3/events.json","paper":"https://pith.science/paper/ZUHVGFGZ"},"agent_actions":{"view_html":"https://pith.science/pith/ZUHVGFGZ3CGOGT23NKXHZQOIV3","download_json":"https://pith.science/pith/ZUHVGFGZ3CGOGT23NKXHZQOIV3.json","view_paper":"https://pith.science/paper/ZUHVGFGZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.03046&json=true","fetch_graph":"https://pith.science/api/pith-number/ZUHVGFGZ3CGOGT23NKXHZQOIV3/graph.json","fetch_events":"https://pith.science/api/pith-number/ZUHVGFGZ3CGOGT23NKXHZQOIV3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZUHVGFGZ3CGOGT23NKXHZQOIV3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZUHVGFGZ3CGOGT23NKXHZQOIV3/action/storage_attestation","attest_author":"https://pith.science/pith/ZUHVGFGZ3CGOGT23NKXHZQOIV3/action/author_attestation","sign_citation":"https://pith.science/pith/ZUHVGFGZ3CGOGT23NKXHZQOIV3/action/citation_signature","submit_replication":"https://pith.science/pith/ZUHVGFGZ3CGOGT23NKXHZQOIV3/action/replication_record"}},"created_at":"2026-05-18T01:17:52.728780+00:00","updated_at":"2026-05-18T01:17:52.728780+00:00"}