{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:RY6O7TI7CTQVCB3UD3C224T5HP","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"1c9e6b03292ceba4a8061358f572e6a2e43b86585c7871ee3210f78d834aae88","cross_cats_sorted":["math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2025-09-09T19:59:21Z","title_canon_sha256":"21c8271e1adfdca4cfa5a0ecfc0d7ddb022909d82a4c2b69aff7ef9d051f3e5c"},"schema_version":"1.0","source":{"id":"2509.08121","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2509.08121","created_at":"2026-07-05T12:08:22Z"},{"alias_kind":"arxiv_version","alias_value":"2509.08121v1","created_at":"2026-07-05T12:08:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.08121","created_at":"2026-07-05T12:08:22Z"},{"alias_kind":"pith_short_12","alias_value":"RY6O7TI7CTQV","created_at":"2026-07-05T12:08:22Z"},{"alias_kind":"pith_short_16","alias_value":"RY6O7TI7CTQVCB3U","created_at":"2026-07-05T12:08:22Z"},{"alias_kind":"pith_short_8","alias_value":"RY6O7TI7","created_at":"2026-07-05T12:08:22Z"}],"graph_snapshots":[{"event_id":"sha256:eb5142d748793262da2a33b290d610cadd96d830b4bd70c20df749a231dce0bc","target":"graph","created_at":"2026-07-05T12:08:22Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2509.08121/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Aditi Laddha, Madhusudhan Reddy Pittu","cross_cats":["math.CO"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2025-09-09T19:59:21Z","title":"An Algorithmic Upper Bound for Permanents via a Permanental Schur Inequality"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.08121","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:f770d6cb665c699447a6f4a82429ce0cc237a52fad654fee429690e7a24ad9aa","target":"record","created_at":"2026-07-05T12:08:22Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"1c9e6b03292ceba4a8061358f572e6a2e43b86585c7871ee3210f78d834aae88","cross_cats_sorted":["math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2025-09-09T19:59:21Z","title_canon_sha256":"21c8271e1adfdca4cfa5a0ecfc0d7ddb022909d82a4c2b69aff7ef9d051f3e5c"},"schema_version":"1.0","source":{"id":"2509.08121","kind":"arxiv","version":1}},"canonical_sha256":"8e3cefcd1f14e15107741ec5ad727d3be49e793654871f08f22a5e29571c56b9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8e3cefcd1f14e15107741ec5ad727d3be49e793654871f08f22a5e29571c56b9","first_computed_at":"2026-07-05T12:08:22.770242Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T12:08:22.770242Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0nck7s5YmhHFIrDbwp60PvALh6rwnZTQda4teEGCekI4SNhf8uuvX1eUX9GYZ1dVxj8T3hrLoTe+xjhSqnueAg==","signature_status":"signed_v1","signed_at":"2026-07-05T12:08:22.770908Z","signed_message":"canonical_sha256_bytes"},"source_id":"2509.08121","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f770d6cb665c699447a6f4a82429ce0cc237a52fad654fee429690e7a24ad9aa","sha256:eb5142d748793262da2a33b290d610cadd96d830b4bd70c20df749a231dce0bc"],"state_sha256":"09cb1467880e2be9a0c00a12ffdcacf402407cb23e181b89264a61258d80d219"}