{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:X557WMY32UAG7GAZWE2RR7H4A5","short_pith_number":"pith:X557WMY3","schema_version":"1.0","canonical_sha256":"bf7bfb331bd5006f9819b13518fcfc077e11816681ce3f0434e24f50039c3bf0","source":{"kind":"arxiv","id":"1905.02640","version":1},"attestation_state":"computed","paper":{"title":"Induced matchings in strongly biconvex graphs and some algebraic applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.AC","authors_text":"Dariush Kiani, Sara Saeedi Madani","submitted_at":"2019-05-07T15:30:58Z","abstract_excerpt":"In this paper, motivated by a question posed in \\cite{AH}, we introduce strongly biconvex graphs as a subclass of weakly chordal and bipartite graphs. We give a linear time algorithm to find an induced matching for such graphs and we prove that this algorithm indeed gives a maximum induced matching. Applying this algorithm, we provide a strongly biconvex graph whose (monomial) edge ideal does not admit a unique extremal Betti number. Using this constructed graph, we provide an infinite family of the so-called closed graphs (also known as proper interval graphs) whose binomial edge ideals do no"},"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":"1905.02640","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2019-05-07T15:30:58Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"8afd7d568547ea002ee5e930da09cf6e2582af37d5df849bd7b2f99c0823fe16","abstract_canon_sha256":"07049c429bbf1ffe35017a46b8c0132c5731a19a5a1e86d8b229fae1b391633d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:50.845246Z","signature_b64":"DUovv9QRKQcfEDK/JZ8c0UXfAH7COH0bDmUDuCBPHy3oquzb4IPK1P7KuAGQzTeccmrQa+GLZ5aWXQGi9vy4Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bf7bfb331bd5006f9819b13518fcfc077e11816681ce3f0434e24f50039c3bf0","last_reissued_at":"2026-05-17T23:46:50.844715Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:50.844715Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Induced matchings in strongly biconvex graphs and some algebraic applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.AC","authors_text":"Dariush Kiani, Sara Saeedi Madani","submitted_at":"2019-05-07T15:30:58Z","abstract_excerpt":"In this paper, motivated by a question posed in \\cite{AH}, we introduce strongly biconvex graphs as a subclass of weakly chordal and bipartite graphs. We give a linear time algorithm to find an induced matching for such graphs and we prove that this algorithm indeed gives a maximum induced matching. Applying this algorithm, we provide a strongly biconvex graph whose (monomial) edge ideal does not admit a unique extremal Betti number. Using this constructed graph, we provide an infinite family of the so-called closed graphs (also known as proper interval graphs) whose binomial edge ideals do no"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.02640","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":"1905.02640","created_at":"2026-05-17T23:46:50.844789+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.02640v1","created_at":"2026-05-17T23:46:50.844789+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.02640","created_at":"2026-05-17T23:46:50.844789+00:00"},{"alias_kind":"pith_short_12","alias_value":"X557WMY32UAG","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_16","alias_value":"X557WMY32UAG7GAZ","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_8","alias_value":"X557WMY3","created_at":"2026-05-18T12:33:33.725879+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/X557WMY32UAG7GAZWE2RR7H4A5","json":"https://pith.science/pith/X557WMY32UAG7GAZWE2RR7H4A5.json","graph_json":"https://pith.science/api/pith-number/X557WMY32UAG7GAZWE2RR7H4A5/graph.json","events_json":"https://pith.science/api/pith-number/X557WMY32UAG7GAZWE2RR7H4A5/events.json","paper":"https://pith.science/paper/X557WMY3"},"agent_actions":{"view_html":"https://pith.science/pith/X557WMY32UAG7GAZWE2RR7H4A5","download_json":"https://pith.science/pith/X557WMY32UAG7GAZWE2RR7H4A5.json","view_paper":"https://pith.science/paper/X557WMY3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.02640&json=true","fetch_graph":"https://pith.science/api/pith-number/X557WMY32UAG7GAZWE2RR7H4A5/graph.json","fetch_events":"https://pith.science/api/pith-number/X557WMY32UAG7GAZWE2RR7H4A5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X557WMY32UAG7GAZWE2RR7H4A5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X557WMY32UAG7GAZWE2RR7H4A5/action/storage_attestation","attest_author":"https://pith.science/pith/X557WMY32UAG7GAZWE2RR7H4A5/action/author_attestation","sign_citation":"https://pith.science/pith/X557WMY32UAG7GAZWE2RR7H4A5/action/citation_signature","submit_replication":"https://pith.science/pith/X557WMY32UAG7GAZWE2RR7H4A5/action/replication_record"}},"created_at":"2026-05-17T23:46:50.844789+00:00","updated_at":"2026-05-17T23:46:50.844789+00:00"}