{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:NXVNTD33RKD2YTFV6CT3QXOCWP","short_pith_number":"pith:NXVNTD33","schema_version":"1.0","canonical_sha256":"6dead98f7b8a87ac4cb5f0a7b85dc2b3da6acbc494bb5363b91def28438bc4c5","source":{"kind":"arxiv","id":"1412.3881","version":2},"attestation_state":"computed","paper":{"title":"Dominating induced matchings of finite graphs and regularity of edge ideals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AC"],"primary_cat":"math.CO","authors_text":"Akihiro Higashitani, Akiyoshi Tsuchiya, Kyouko Kimura, Takayuki Hibi","submitted_at":"2014-12-12T03:49:06Z","abstract_excerpt":"The regularity of an edge ideal of a finite simple graph $G$ is at least the induced matching number of $G$ and is at most the minimum matching number of $G$. If $G$ possesses a dominating inuduced matching, i.e., an induced matching which forms a maximal matching, then the induced matching number of $G$ is equal to the minimum matching number of $G$. In the present paper, from viewpoints of both combinatorics and commutative algebra, finite simple graphs with dominating induced matchings will be mainly studied."},"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":"1412.3881","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-12-12T03:49:06Z","cross_cats_sorted":["math.AC"],"title_canon_sha256":"a74619c2ac15c999ee2e12002587ee5081fbefbaeceee05fd8060554760759d8","abstract_canon_sha256":"c6596d360adaf7ea402254fb8564324806be6935981f03da506eb94bed65cd81"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:34:45.448180Z","signature_b64":"0p6CeqrIYode+eL9I+wdkTe958uhdA5q07ry64KAVQU6FgiLVwaQsjNLNCS4C4hFWsFVSk7HQuCFf7zEhd6NDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6dead98f7b8a87ac4cb5f0a7b85dc2b3da6acbc494bb5363b91def28438bc4c5","last_reissued_at":"2026-05-18T01:34:45.447457Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:34:45.447457Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dominating induced matchings of finite graphs and regularity of edge ideals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AC"],"primary_cat":"math.CO","authors_text":"Akihiro Higashitani, Akiyoshi Tsuchiya, Kyouko Kimura, Takayuki Hibi","submitted_at":"2014-12-12T03:49:06Z","abstract_excerpt":"The regularity of an edge ideal of a finite simple graph $G$ is at least the induced matching number of $G$ and is at most the minimum matching number of $G$. If $G$ possesses a dominating inuduced matching, i.e., an induced matching which forms a maximal matching, then the induced matching number of $G$ is equal to the minimum matching number of $G$. In the present paper, from viewpoints of both combinatorics and commutative algebra, finite simple graphs with dominating induced matchings will be mainly studied."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.3881","kind":"arxiv","version":2},"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":"1412.3881","created_at":"2026-05-18T01:34:45.447591+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.3881v2","created_at":"2026-05-18T01:34:45.447591+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.3881","created_at":"2026-05-18T01:34:45.447591+00:00"},{"alias_kind":"pith_short_12","alias_value":"NXVNTD33RKD2","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_16","alias_value":"NXVNTD33RKD2YTFV","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_8","alias_value":"NXVNTD33","created_at":"2026-05-18T12:28:41.024544+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/NXVNTD33RKD2YTFV6CT3QXOCWP","json":"https://pith.science/pith/NXVNTD33RKD2YTFV6CT3QXOCWP.json","graph_json":"https://pith.science/api/pith-number/NXVNTD33RKD2YTFV6CT3QXOCWP/graph.json","events_json":"https://pith.science/api/pith-number/NXVNTD33RKD2YTFV6CT3QXOCWP/events.json","paper":"https://pith.science/paper/NXVNTD33"},"agent_actions":{"view_html":"https://pith.science/pith/NXVNTD33RKD2YTFV6CT3QXOCWP","download_json":"https://pith.science/pith/NXVNTD33RKD2YTFV6CT3QXOCWP.json","view_paper":"https://pith.science/paper/NXVNTD33","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.3881&json=true","fetch_graph":"https://pith.science/api/pith-number/NXVNTD33RKD2YTFV6CT3QXOCWP/graph.json","fetch_events":"https://pith.science/api/pith-number/NXVNTD33RKD2YTFV6CT3QXOCWP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NXVNTD33RKD2YTFV6CT3QXOCWP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NXVNTD33RKD2YTFV6CT3QXOCWP/action/storage_attestation","attest_author":"https://pith.science/pith/NXVNTD33RKD2YTFV6CT3QXOCWP/action/author_attestation","sign_citation":"https://pith.science/pith/NXVNTD33RKD2YTFV6CT3QXOCWP/action/citation_signature","submit_replication":"https://pith.science/pith/NXVNTD33RKD2YTFV6CT3QXOCWP/action/replication_record"}},"created_at":"2026-05-18T01:34:45.447591+00:00","updated_at":"2026-05-18T01:34:45.447591+00:00"}