{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:RY6O7TI7CTQVCB3UD3C224T5HP","short_pith_number":"pith:RY6O7TI7","schema_version":"1.0","canonical_sha256":"8e3cefcd1f14e15107741ec5ad727d3be49e793654871f08f22a5e29571c56b9","source":{"kind":"arxiv","id":"2509.08121","version":1},"attestation_state":"computed","paper":{"title":"An Algorithmic Upper Bound for Permanents via a Permanental Schur Inequality","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Aditi Laddha, Madhusudhan Reddy Pittu","submitted_at":"2025-09-09T19:59:21Z","abstract_excerpt":"Computing the permanent of a non-negative matrix is a computationally challenging, \\#P-complete problem with wide-ranging applications. We introduce a novel permanental analogue of Schur's determinant formula, leveraging a newly defined \\emph{permanental inverse}. Building on this, we introduce an iterative, deterministic procedure called the \\emph{permanent process}, analogous to Gaussian elimination, which yields constructive and algorithmically computable upper bounds on the permanent. Our framework provides particularly strong guarantees for matrices exhibiting approximate diagonal dominan"},"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":"2509.08121","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2025-09-09T19:59:21Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"21c8271e1adfdca4cfa5a0ecfc0d7ddb022909d82a4c2b69aff7ef9d051f3e5c","abstract_canon_sha256":"1c9e6b03292ceba4a8061358f572e6a2e43b86585c7871ee3210f78d834aae88"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:08:22.770908Z","signature_b64":"0nck7s5YmhHFIrDbwp60PvALh6rwnZTQda4teEGCekI4SNhf8uuvX1eUX9GYZ1dVxj8T3hrLoTe+xjhSqnueAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8e3cefcd1f14e15107741ec5ad727d3be49e793654871f08f22a5e29571c56b9","last_reissued_at":"2026-07-05T12:08:22.770242Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:08:22.770242Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Algorithmic Upper Bound for Permanents via a Permanental Schur Inequality","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Aditi Laddha, Madhusudhan Reddy Pittu","submitted_at":"2025-09-09T19:59:21Z","abstract_excerpt":"Computing the permanent of a non-negative matrix is a computationally challenging, \\#P-complete problem with wide-ranging applications. We introduce a novel permanental analogue of Schur's determinant formula, leveraging a newly defined \\emph{permanental inverse}. Building on this, we introduce an iterative, deterministic procedure called the \\emph{permanent process}, analogous to Gaussian elimination, which yields constructive and algorithmically computable upper bounds on the permanent. Our framework provides particularly strong guarantees for matrices exhibiting approximate diagonal dominan"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.08121","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/2509.08121/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":"2509.08121","created_at":"2026-07-05T12:08:22.770328+00:00"},{"alias_kind":"arxiv_version","alias_value":"2509.08121v1","created_at":"2026-07-05T12:08:22.770328+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.08121","created_at":"2026-07-05T12:08:22.770328+00:00"},{"alias_kind":"pith_short_12","alias_value":"RY6O7TI7CTQV","created_at":"2026-07-05T12:08:22.770328+00:00"},{"alias_kind":"pith_short_16","alias_value":"RY6O7TI7CTQVCB3U","created_at":"2026-07-05T12:08:22.770328+00:00"},{"alias_kind":"pith_short_8","alias_value":"RY6O7TI7","created_at":"2026-07-05T12:08:22.770328+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/RY6O7TI7CTQVCB3UD3C224T5HP","json":"https://pith.science/pith/RY6O7TI7CTQVCB3UD3C224T5HP.json","graph_json":"https://pith.science/api/pith-number/RY6O7TI7CTQVCB3UD3C224T5HP/graph.json","events_json":"https://pith.science/api/pith-number/RY6O7TI7CTQVCB3UD3C224T5HP/events.json","paper":"https://pith.science/paper/RY6O7TI7"},"agent_actions":{"view_html":"https://pith.science/pith/RY6O7TI7CTQVCB3UD3C224T5HP","download_json":"https://pith.science/pith/RY6O7TI7CTQVCB3UD3C224T5HP.json","view_paper":"https://pith.science/paper/RY6O7TI7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2509.08121&json=true","fetch_graph":"https://pith.science/api/pith-number/RY6O7TI7CTQVCB3UD3C224T5HP/graph.json","fetch_events":"https://pith.science/api/pith-number/RY6O7TI7CTQVCB3UD3C224T5HP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RY6O7TI7CTQVCB3UD3C224T5HP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RY6O7TI7CTQVCB3UD3C224T5HP/action/storage_attestation","attest_author":"https://pith.science/pith/RY6O7TI7CTQVCB3UD3C224T5HP/action/author_attestation","sign_citation":"https://pith.science/pith/RY6O7TI7CTQVCB3UD3C224T5HP/action/citation_signature","submit_replication":"https://pith.science/pith/RY6O7TI7CTQVCB3UD3C224T5HP/action/replication_record"}},"created_at":"2026-07-05T12:08:22.770328+00:00","updated_at":"2026-07-05T12:08:22.770328+00:00"}