{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:UII6EEYYWJ5YWKTVR6F5MW6HGM","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":"ceacae049aa6cfd8191ff8ac4009834b51dbe6d7a665896e913ce1ab66615a04","cross_cats_sorted":["stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2011-02-23T07:11:18Z","title_canon_sha256":"33d6954438917b34670c666ad8614177afca2c75a82fee06f4d92c29e0a82cad"},"schema_version":"1.0","source":{"id":"1102.4674","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.4674","created_at":"2026-05-18T03:29:38Z"},{"alias_kind":"arxiv_version","alias_value":"1102.4674v1","created_at":"2026-05-18T03:29:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.4674","created_at":"2026-05-18T03:29:38Z"},{"alias_kind":"pith_short_12","alias_value":"UII6EEYYWJ5Y","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_16","alias_value":"UII6EEYYWJ5YWKTV","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_8","alias_value":"UII6EEYY","created_at":"2026-05-18T12:26:42Z"}],"graph_snapshots":[{"event_id":"sha256:4cb6ba2426ac93a99c3867501eb4977a47ddfe2a2fdcdae88147fc8a2155ec13","target":"graph","created_at":"2026-05-18T03:29:38Z","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":"We give an exponential lower bound for the Graver complexity of the incidence matrix of a complete bipartite graph of arbitrary size. Our result is a generalization of the result by Berstein and Onn (2009) for 3xr complete bipartite graphs, r \\ge 3.","authors_text":"Akimichi Takemura, Taisei Kudo","cross_cats":["stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2011-02-23T07:11:18Z","title":"A lower bound for the Graver complexity of the incidence matrix of a complete bipartite graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.4674","kind":"arxiv","version":1},"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:0ecc96be5edbc42279e5bfa760f1d253de0d45caf0caca70ee3e1bfc955a806a","target":"record","created_at":"2026-05-18T03:29:38Z","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":"ceacae049aa6cfd8191ff8ac4009834b51dbe6d7a665896e913ce1ab66615a04","cross_cats_sorted":["stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2011-02-23T07:11:18Z","title_canon_sha256":"33d6954438917b34670c666ad8614177afca2c75a82fee06f4d92c29e0a82cad"},"schema_version":"1.0","source":{"id":"1102.4674","kind":"arxiv","version":1}},"canonical_sha256":"a211e21318b27b8b2a758f8bd65bc7333c53e19240e666a3c6c6316433dfcb03","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a211e21318b27b8b2a758f8bd65bc7333c53e19240e666a3c6c6316433dfcb03","first_computed_at":"2026-05-18T03:29:38.723463Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:29:38.723463Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rfN43TZwMsmhtsb1NhXw8cIepIE9J7o5e9tavygMnYW+uLj8a4AwiZqgKJLd4nvE4GvYqtUcjeQoIxF4SkZ/AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:29:38.723989Z","signed_message":"canonical_sha256_bytes"},"source_id":"1102.4674","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0ecc96be5edbc42279e5bfa760f1d253de0d45caf0caca70ee3e1bfc955a806a","sha256:4cb6ba2426ac93a99c3867501eb4977a47ddfe2a2fdcdae88147fc8a2155ec13"],"state_sha256":"a421319cab58055a097c29d321a4da1927d74ceda029eb6aaa1248d27189d793"}