{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:IK3RUQUN5E73QMRNLIFTT3ZJVJ","short_pith_number":"pith:IK3RUQUN","canonical_record":{"source":{"id":"2604.08397","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-04-09T15:57:53Z","cross_cats_sorted":[],"title_canon_sha256":"82c4df594035f7629160cf9b2240c2dd42e000915360984e6119d343e3006127","abstract_canon_sha256":"a2b3e77ed4afb2b3f4718d6b2e9f13d7bc39392855d57c674cd3e8bf1a8b766b"},"schema_version":"1.0"},"canonical_sha256":"42b71a428de93fb8322d5a0b39ef29aa657f99cfd6c20209f0ae37055a7a3ccb","source":{"kind":"arxiv","id":"2604.08397","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.08397","created_at":"2026-05-27T01:04:57Z"},{"alias_kind":"arxiv_version","alias_value":"2604.08397v2","created_at":"2026-05-27T01:04:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.08397","created_at":"2026-05-27T01:04:57Z"},{"alias_kind":"pith_short_12","alias_value":"IK3RUQUN5E73","created_at":"2026-05-27T01:04:57Z"},{"alias_kind":"pith_short_16","alias_value":"IK3RUQUN5E73QMRN","created_at":"2026-05-27T01:04:57Z"},{"alias_kind":"pith_short_8","alias_value":"IK3RUQUN","created_at":"2026-05-27T01:04:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:IK3RUQUN5E73QMRNLIFTT3ZJVJ","target":"record","payload":{"canonical_record":{"source":{"id":"2604.08397","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-04-09T15:57:53Z","cross_cats_sorted":[],"title_canon_sha256":"82c4df594035f7629160cf9b2240c2dd42e000915360984e6119d343e3006127","abstract_canon_sha256":"a2b3e77ed4afb2b3f4718d6b2e9f13d7bc39392855d57c674cd3e8bf1a8b766b"},"schema_version":"1.0"},"canonical_sha256":"42b71a428de93fb8322d5a0b39ef29aa657f99cfd6c20209f0ae37055a7a3ccb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-27T01:04:57.969188Z","signature_b64":"G7SR35vWeYSmh9n/mzHZBnghfWqiEdy+7qitFiK8oWGXzcFvRwos7EbYESv1nmuWpUZ5gzw3tUyv8/pASyFlAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"42b71a428de93fb8322d5a0b39ef29aa657f99cfd6c20209f0ae37055a7a3ccb","last_reissued_at":"2026-05-27T01:04:57.968493Z","signature_status":"signed_v1","first_computed_at":"2026-05-27T01:04:57.968493Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2604.08397","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-27T01:04:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5Uztf7RbgbOEUYgj0aLzYuU0oIvgmcnALLzmsp35tvUCS9J1q/IvD3CTw50ZbuHK7D55IMXwfaj3fwpSs/8HBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T10:44:32.533151Z"},"content_sha256":"fbef9da918bbfb81f11fa13dcd239e0d88f2f6f9abd8c48e82bf9f4d2e8fd63b","schema_version":"1.0","event_id":"sha256:fbef9da918bbfb81f11fa13dcd239e0d88f2f6f9abd8c48e82bf9f4d2e8fd63b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:IK3RUQUN5E73QMRNLIFTT3ZJVJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"4-cycle-free induced subgraphs of grid graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Maximal vertex sets inducing C4-free subgraphs in 2D grid graphs are explicitly characterized.","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ernie Croot, Taiki Aiba","submitted_at":"2026-04-09T15:57:53Z","abstract_excerpt":"The avoidance of induced forests, or induced acyclic subgraphs, in $d$-dimensional grid graphs, or lattice graphs, has been studied in Alon et al. and later in Caragiannis et al., finding upper and lower bounds with respect to the number of vertices in a single dimension $n$ and the dimension $d$. In this work, we study the avoidance of induced $C_4$-free subgraphs, a superset of induced forests, of $2$-dimensional grid graphs $G$ and characterize the maximal sets $S \\subseteq V$ such that the induced subgraph $G_S$ of $G$ with vertex set $S$ is $C_4$-free. Additionally, we will give upper and"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We characterize the maximal sets S ⊆ V such that the induced subgraph G_S of G with vertex set S is C4-free. Additionally, we give upper and lower bounds on the number of C4-free induced subgraphs with slightly fewer vertices than contained in the maximum.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The characterization and bounds hold specifically for finite 2-dimensional grid graphs with the standard grid adjacency; the argument may rely on the rectangular lattice structure and induced-subgraph definition without additional constraints on boundary effects.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Maximal induced C4-free subgraphs of 2D grid graphs are characterized, with upper and lower bounds on the number of slightly smaller ones.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Maximal vertex sets inducing C4-free subgraphs in 2D grid graphs are explicitly characterized.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"1687349232544f1c5622dc4f30124ffd4214ed0b337c36f8cb3c627dc86e9210"},"source":{"id":"2604.08397","kind":"arxiv","version":2},"verdict":{"id":"7528d623-5a8b-421a-87ad-e9c36b34d27b","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-10T16:45:36.718600Z","strongest_claim":"We characterize the maximal sets S ⊆ V such that the induced subgraph G_S of G with vertex set S is C4-free. Additionally, we give upper and lower bounds on the number of C4-free induced subgraphs with slightly fewer vertices than contained in the maximum.","one_line_summary":"Maximal induced C4-free subgraphs of 2D grid graphs are characterized, with upper and lower bounds on the number of slightly smaller ones.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The characterization and bounds hold specifically for finite 2-dimensional grid graphs with the standard grid adjacency; the argument may rely on the rectangular lattice structure and induced-subgraph definition without additional constraints on boundary effects.","pith_extraction_headline":"Maximal vertex sets inducing C4-free subgraphs in 2D grid graphs are explicitly characterized."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2604.08397/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"},"verdict_id":"7528d623-5a8b-421a-87ad-e9c36b34d27b"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-27T01:04:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TRcP2VKy23kVINsRzts4Fy74zU+Q5s4v6LRyLhSr0u9YP5yVnpK/OToMlTwKJhknk92RlFMyh+rrYSbjIlgXDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T10:44:32.533728Z"},"content_sha256":"0b98ecd1cd737295a30969c0b9f3078881ce3f862727e9c99efbc06e5aa92746","schema_version":"1.0","event_id":"sha256:0b98ecd1cd737295a30969c0b9f3078881ce3f862727e9c99efbc06e5aa92746"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IK3RUQUN5E73QMRNLIFTT3ZJVJ/bundle.json","state_url":"https://pith.science/pith/IK3RUQUN5E73QMRNLIFTT3ZJVJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IK3RUQUN5E73QMRNLIFTT3ZJVJ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-02T10:44:32Z","links":{"resolver":"https://pith.science/pith/IK3RUQUN5E73QMRNLIFTT3ZJVJ","bundle":"https://pith.science/pith/IK3RUQUN5E73QMRNLIFTT3ZJVJ/bundle.json","state":"https://pith.science/pith/IK3RUQUN5E73QMRNLIFTT3ZJVJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IK3RUQUN5E73QMRNLIFTT3ZJVJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:IK3RUQUN5E73QMRNLIFTT3ZJVJ","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":"a2b3e77ed4afb2b3f4718d6b2e9f13d7bc39392855d57c674cd3e8bf1a8b766b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-04-09T15:57:53Z","title_canon_sha256":"82c4df594035f7629160cf9b2240c2dd42e000915360984e6119d343e3006127"},"schema_version":"1.0","source":{"id":"2604.08397","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.08397","created_at":"2026-05-27T01:04:57Z"},{"alias_kind":"arxiv_version","alias_value":"2604.08397v2","created_at":"2026-05-27T01:04:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.08397","created_at":"2026-05-27T01:04:57Z"},{"alias_kind":"pith_short_12","alias_value":"IK3RUQUN5E73","created_at":"2026-05-27T01:04:57Z"},{"alias_kind":"pith_short_16","alias_value":"IK3RUQUN5E73QMRN","created_at":"2026-05-27T01:04:57Z"},{"alias_kind":"pith_short_8","alias_value":"IK3RUQUN","created_at":"2026-05-27T01:04:57Z"}],"graph_snapshots":[{"event_id":"sha256:0b98ecd1cd737295a30969c0b9f3078881ce3f862727e9c99efbc06e5aa92746","target":"graph","created_at":"2026-05-27T01:04:57Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"We characterize the maximal sets S ⊆ V such that the induced subgraph G_S of G with vertex set S is C4-free. Additionally, we give upper and lower bounds on the number of C4-free induced subgraphs with slightly fewer vertices than contained in the maximum."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The characterization and bounds hold specifically for finite 2-dimensional grid graphs with the standard grid adjacency; the argument may rely on the rectangular lattice structure and induced-subgraph definition without additional constraints on boundary effects."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Maximal induced C4-free subgraphs of 2D grid graphs are characterized, with upper and lower bounds on the number of slightly smaller ones."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Maximal vertex sets inducing C4-free subgraphs in 2D grid graphs are explicitly characterized."}],"snapshot_sha256":"1687349232544f1c5622dc4f30124ffd4214ed0b337c36f8cb3c627dc86e9210"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2604.08397/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The avoidance of induced forests, or induced acyclic subgraphs, in $d$-dimensional grid graphs, or lattice graphs, has been studied in Alon et al. and later in Caragiannis et al., finding upper and lower bounds with respect to the number of vertices in a single dimension $n$ and the dimension $d$. In this work, we study the avoidance of induced $C_4$-free subgraphs, a superset of induced forests, of $2$-dimensional grid graphs $G$ and characterize the maximal sets $S \\subseteq V$ such that the induced subgraph $G_S$ of $G$ with vertex set $S$ is $C_4$-free. Additionally, we will give upper and","authors_text":"Ernie Croot, Taiki Aiba","cross_cats":[],"headline":"Maximal vertex sets inducing C4-free subgraphs in 2D grid graphs are explicitly characterized.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-04-09T15:57:53Z","title":"4-cycle-free induced subgraphs of grid graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2604.08397","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-10T16:45:36.718600Z","id":"7528d623-5a8b-421a-87ad-e9c36b34d27b","model_set":{"reader":"grok-4.3"},"one_line_summary":"Maximal induced C4-free subgraphs of 2D grid graphs are characterized, with upper and lower bounds on the number of slightly smaller ones.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Maximal vertex sets inducing C4-free subgraphs in 2D grid graphs are explicitly characterized.","strongest_claim":"We characterize the maximal sets S ⊆ V such that the induced subgraph G_S of G with vertex set S is C4-free. Additionally, we give upper and lower bounds on the number of C4-free induced subgraphs with slightly fewer vertices than contained in the maximum.","weakest_assumption":"The characterization and bounds hold specifically for finite 2-dimensional grid graphs with the standard grid adjacency; the argument may rely on the rectangular lattice structure and induced-subgraph definition without additional constraints on boundary effects."}},"verdict_id":"7528d623-5a8b-421a-87ad-e9c36b34d27b"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:fbef9da918bbfb81f11fa13dcd239e0d88f2f6f9abd8c48e82bf9f4d2e8fd63b","target":"record","created_at":"2026-05-27T01:04:57Z","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":"a2b3e77ed4afb2b3f4718d6b2e9f13d7bc39392855d57c674cd3e8bf1a8b766b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-04-09T15:57:53Z","title_canon_sha256":"82c4df594035f7629160cf9b2240c2dd42e000915360984e6119d343e3006127"},"schema_version":"1.0","source":{"id":"2604.08397","kind":"arxiv","version":2}},"canonical_sha256":"42b71a428de93fb8322d5a0b39ef29aa657f99cfd6c20209f0ae37055a7a3ccb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"42b71a428de93fb8322d5a0b39ef29aa657f99cfd6c20209f0ae37055a7a3ccb","first_computed_at":"2026-05-27T01:04:57.968493Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-27T01:04:57.968493Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"G7SR35vWeYSmh9n/mzHZBnghfWqiEdy+7qitFiK8oWGXzcFvRwos7EbYESv1nmuWpUZ5gzw3tUyv8/pASyFlAA==","signature_status":"signed_v1","signed_at":"2026-05-27T01:04:57.969188Z","signed_message":"canonical_sha256_bytes"},"source_id":"2604.08397","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fbef9da918bbfb81f11fa13dcd239e0d88f2f6f9abd8c48e82bf9f4d2e8fd63b","sha256:0b98ecd1cd737295a30969c0b9f3078881ce3f862727e9c99efbc06e5aa92746"],"state_sha256":"fc75243696366d7fb3bea9d81f4fac6c592c60b8b087975c9f142adf4fc8f483"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JedDTAehHkzkwEkmJVxxyY3IuzK259EqLp+EP4BqmwMG9PkXTNZrK8K1yKYFnaI+OyPgKmlV5x1emuvzgZ51Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T10:44:32.536324Z","bundle_sha256":"074fde787c9115aceedba5db8add276bcc2c072cc92a7e50c23e68fa3702fe94"}}