{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:NHZYVSO46IAYWVVHTP7YXBAYZX","short_pith_number":"pith:NHZYVSO4","schema_version":"1.0","canonical_sha256":"69f38ac9dcf2018b56a79bff8b8418cde9d4b7cc59de8c504d9fe659e8167a8b","source":{"kind":"arxiv","id":"2411.14238","version":1},"attestation_state":"computed","paper":{"title":"Computing the permanental polynomial of $4k$-intercyclic bipartite graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Hitesh Wankhede, Ranveer Singh, Ravindra B. Bapat","submitted_at":"2024-11-21T15:48:38Z","abstract_excerpt":"Let $G$ be a bipartite graph with adjacency matrix $A(G)$. The characteristic polynomial $\\phi(G,x)=\\det(xI-A(G))$ and the permanental polynomial $\\pi(G,x) = \\text{per}(xI-A(G))$ are both graph invariants used to distinguish graphs. For bipartite graphs, we define the modified characteristic polynomial, which is obtained by changing the signs of some of the coefficients of $\\phi(G,x)$. For $4k$-intercyclic bipartite graphs, i.e., those for which the removal of any $4k$-cycle results in a $C_{4k}$-free graph, we provide an expression for $\\pi(G,x)$ in terms of the modified characteristic polyno"},"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":"2411.14238","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-11-21T15:48:38Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"9554cc80e43c260f87ef197e00838b593845bbfacd278f446a31d54945e2eb78","abstract_canon_sha256":"2f05a9d1c355068261320f79e2a08713ffec0c1e8844e0fe18c7d59b0653a86c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:38:43.859509Z","signature_b64":"fxCbX6vSMkFsT7kYKK5nAGEd7Wflh/VVV2K9HdgHO/AvTpCK64HDNIB+LHRQZ8lYgY4ne2YkzPb2HFaEmN9HAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"69f38ac9dcf2018b56a79bff8b8418cde9d4b7cc59de8c504d9fe659e8167a8b","last_reissued_at":"2026-07-05T09:38:43.859013Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:38:43.859013Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computing the permanental polynomial of $4k$-intercyclic bipartite graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Hitesh Wankhede, Ranveer Singh, Ravindra B. Bapat","submitted_at":"2024-11-21T15:48:38Z","abstract_excerpt":"Let $G$ be a bipartite graph with adjacency matrix $A(G)$. The characteristic polynomial $\\phi(G,x)=\\det(xI-A(G))$ and the permanental polynomial $\\pi(G,x) = \\text{per}(xI-A(G))$ are both graph invariants used to distinguish graphs. For bipartite graphs, we define the modified characteristic polynomial, which is obtained by changing the signs of some of the coefficients of $\\phi(G,x)$. For $4k$-intercyclic bipartite graphs, i.e., those for which the removal of any $4k$-cycle results in a $C_{4k}$-free graph, we provide an expression for $\\pi(G,x)$ in terms of the modified characteristic polyno"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.14238","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/2411.14238/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":"2411.14238","created_at":"2026-07-05T09:38:43.859072+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.14238v1","created_at":"2026-07-05T09:38:43.859072+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.14238","created_at":"2026-07-05T09:38:43.859072+00:00"},{"alias_kind":"pith_short_12","alias_value":"NHZYVSO46IAY","created_at":"2026-07-05T09:38:43.859072+00:00"},{"alias_kind":"pith_short_16","alias_value":"NHZYVSO46IAYWVVH","created_at":"2026-07-05T09:38:43.859072+00:00"},{"alias_kind":"pith_short_8","alias_value":"NHZYVSO4","created_at":"2026-07-05T09:38:43.859072+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/NHZYVSO46IAYWVVHTP7YXBAYZX","json":"https://pith.science/pith/NHZYVSO46IAYWVVHTP7YXBAYZX.json","graph_json":"https://pith.science/api/pith-number/NHZYVSO46IAYWVVHTP7YXBAYZX/graph.json","events_json":"https://pith.science/api/pith-number/NHZYVSO46IAYWVVHTP7YXBAYZX/events.json","paper":"https://pith.science/paper/NHZYVSO4"},"agent_actions":{"view_html":"https://pith.science/pith/NHZYVSO46IAYWVVHTP7YXBAYZX","download_json":"https://pith.science/pith/NHZYVSO46IAYWVVHTP7YXBAYZX.json","view_paper":"https://pith.science/paper/NHZYVSO4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.14238&json=true","fetch_graph":"https://pith.science/api/pith-number/NHZYVSO46IAYWVVHTP7YXBAYZX/graph.json","fetch_events":"https://pith.science/api/pith-number/NHZYVSO46IAYWVVHTP7YXBAYZX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NHZYVSO46IAYWVVHTP7YXBAYZX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NHZYVSO46IAYWVVHTP7YXBAYZX/action/storage_attestation","attest_author":"https://pith.science/pith/NHZYVSO46IAYWVVHTP7YXBAYZX/action/author_attestation","sign_citation":"https://pith.science/pith/NHZYVSO46IAYWVVHTP7YXBAYZX/action/citation_signature","submit_replication":"https://pith.science/pith/NHZYVSO46IAYWVVHTP7YXBAYZX/action/replication_record"}},"created_at":"2026-07-05T09:38:43.859072+00:00","updated_at":"2026-07-05T09:38:43.859072+00:00"}