{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:V3CYZNIFDX4ELZ6BURHLV3JXHI","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":"644ae8bcc57d82ae70bdc20d715a368058a6ef924e6838665a91212176312839","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2013-08-22T05:48:54Z","title_canon_sha256":"f561aad9fd0b55312249b5fbf48c6460b732ce7d47f9e8d5a41be2a77bb113d7"},"schema_version":"1.0","source":{"id":"1308.4765","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.4765","created_at":"2026-05-18T02:47:07Z"},{"alias_kind":"arxiv_version","alias_value":"1308.4765v4","created_at":"2026-05-18T02:47:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.4765","created_at":"2026-05-18T02:47:07Z"},{"alias_kind":"pith_short_12","alias_value":"V3CYZNIFDX4E","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"V3CYZNIFDX4ELZ6B","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"V3CYZNIF","created_at":"2026-05-18T12:28:02Z"}],"graph_snapshots":[{"event_id":"sha256:d4fd1e253e4ac9caa62e7daa407e972bce7ca6052a46f60e958b378f971ab8ab","target":"graph","created_at":"2026-05-18T02:47:07Z","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"},"paper":{"abstract_excerpt":"Let $G$ be a finite simple graph on $[n]$ and $I(G) \\subset S$ the edge ideal of $G$, where $S = K[x_{1}, \\ldots, x_{n}]$ is the polynomial ring over a field $K$. Let $m(G)$ denote the maximum size of matchings of $G$ and $im(G)$ that of induced matchings of $G$. It is known that $im(G) \\leq \\text{reg}(S/I(G)) \\leq m(G)$, where $\\text{reg}(S/I(G))$ is the Castelnuovo-Mumford regularity of $S/I(G)$. Cameron and Walker succeeded in classifying the finite connected simple graphs $G$ with $im(G) = m(G)$. We say that a finite connected simple graph $G$ is a Cameron-Walker graph if $im(G) = m(G)$ an","authors_text":"Akihiro Higashitani, Augustine B. O'Keefe, Kyouko Kimura, Takayuki Hibi","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2013-08-22T05:48:54Z","title":"Algebraic study on Cameron-Walker graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.4765","kind":"arxiv","version":4},"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:bb5d8cfed3e42e1dd58ee353f72930a1ec9bc4f38eb6edcdc4bc512d4b5f3a1a","target":"record","created_at":"2026-05-18T02:47:07Z","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":"644ae8bcc57d82ae70bdc20d715a368058a6ef924e6838665a91212176312839","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2013-08-22T05:48:54Z","title_canon_sha256":"f561aad9fd0b55312249b5fbf48c6460b732ce7d47f9e8d5a41be2a77bb113d7"},"schema_version":"1.0","source":{"id":"1308.4765","kind":"arxiv","version":4}},"canonical_sha256":"aec58cb5051df845e7c1a44ebaed373a079fb328edb60d93f0e1206e91cbfa91","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"aec58cb5051df845e7c1a44ebaed373a079fb328edb60d93f0e1206e91cbfa91","first_computed_at":"2026-05-18T02:47:07.757747Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:47:07.757747Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FX/OT9AsUr52l5t4uyg5JuRwo3bMNNcyFSnGuI2Ne7icRMBanV2gjQDgZwZXVCnvAFS/DUnXSYKw9wwoL9uRDA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:47:07.758207Z","signed_message":"canonical_sha256_bytes"},"source_id":"1308.4765","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bb5d8cfed3e42e1dd58ee353f72930a1ec9bc4f38eb6edcdc4bc512d4b5f3a1a","sha256:d4fd1e253e4ac9caa62e7daa407e972bce7ca6052a46f60e958b378f971ab8ab"],"state_sha256":"363237bb25ed300056dcda4b944394f750e79f326820911c0bf206539253d3a0"}