{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:FJR73EPQZIEIZOCGK5ZMOVNMOH","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":"532f20127711dd07e83b76afcd9e18e943706ada9bc63cea48fea5ca13793b13","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-06-13T10:08:41Z","title_canon_sha256":"7cac2730f5bf03c4ebc25b4671b6c1d1a8d020d6f6dde6fac4ca95103250d897"},"schema_version":"1.0","source":{"id":"1306.3066","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.3066","created_at":"2026-05-18T02:53:30Z"},{"alias_kind":"arxiv_version","alias_value":"1306.3066v2","created_at":"2026-05-18T02:53:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.3066","created_at":"2026-05-18T02:53:30Z"},{"alias_kind":"pith_short_12","alias_value":"FJR73EPQZIEI","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"FJR73EPQZIEIZOCG","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"FJR73EPQ","created_at":"2026-05-18T12:27:45Z"}],"graph_snapshots":[{"event_id":"sha256:984348de7e42ca8318c52426a08f4864c971446dcc283f2b31aae06ccbd12b79","target":"graph","created_at":"2026-05-18T02:53:30Z","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":"A graph is prime (with respect to the split decomposition) if its vertex set does not admit a partition (A,B) (called a split) with |A|, |B| >= 2 such that the set of edges joining A and B induces a complete bipartite graph.\n  We prove that for each n, there exists N such that every prime graph on at least N vertices contains a vertex-minor isomorphic to either a cycle of length n or a graph consisting of two disjoint cliques of size n joined by a matching.","authors_text":"O-joung Kwon, Sang-il Oum","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-06-13T10:08:41Z","title":"Unavoidable vertex-minors in large prime graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.3066","kind":"arxiv","version":2},"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:247c94a0c8c472bdc513048506265f551efb1404fe18c8b03c5bec51abb30d96","target":"record","created_at":"2026-05-18T02:53:30Z","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":"532f20127711dd07e83b76afcd9e18e943706ada9bc63cea48fea5ca13793b13","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-06-13T10:08:41Z","title_canon_sha256":"7cac2730f5bf03c4ebc25b4671b6c1d1a8d020d6f6dde6fac4ca95103250d897"},"schema_version":"1.0","source":{"id":"1306.3066","kind":"arxiv","version":2}},"canonical_sha256":"2a63fd91f0ca088cb8465772c755ac71e293b5cf016e516beadc5a0dead725ab","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2a63fd91f0ca088cb8465772c755ac71e293b5cf016e516beadc5a0dead725ab","first_computed_at":"2026-05-18T02:53:30.213214Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:53:30.213214Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ag3bAjWRhqxQ7yyYJRIYJsMXc5HUhxNhf5AxcyNrdvzXtIl4/1PjwvFFoxhamdn4tjaACMMOCR5qbPW5nVeXAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:53:30.213833Z","signed_message":"canonical_sha256_bytes"},"source_id":"1306.3066","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:247c94a0c8c472bdc513048506265f551efb1404fe18c8b03c5bec51abb30d96","sha256:984348de7e42ca8318c52426a08f4864c971446dcc283f2b31aae06ccbd12b79"],"state_sha256":"d94aab3b17024affbfbfa57764ae314af599e209bf582b94a56d439e844a28a7"}