{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:FJR73EPQZIEIZOCGK5ZMOVNMOH","short_pith_number":"pith:FJR73EPQ","schema_version":"1.0","canonical_sha256":"2a63fd91f0ca088cb8465772c755ac71e293b5cf016e516beadc5a0dead725ab","source":{"kind":"arxiv","id":"1306.3066","version":2},"attestation_state":"computed","paper":{"title":"Unavoidable vertex-minors in large prime graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"O-joung Kwon, Sang-il Oum","submitted_at":"2013-06-13T10:08:41Z","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."},"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":"1306.3066","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-06-13T10:08:41Z","cross_cats_sorted":[],"title_canon_sha256":"7cac2730f5bf03c4ebc25b4671b6c1d1a8d020d6f6dde6fac4ca95103250d897","abstract_canon_sha256":"532f20127711dd07e83b76afcd9e18e943706ada9bc63cea48fea5ca13793b13"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:53:30.213833Z","signature_b64":"ag3bAjWRhqxQ7yyYJRIYJsMXc5HUhxNhf5AxcyNrdvzXtIl4/1PjwvFFoxhamdn4tjaACMMOCR5qbPW5nVeXAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2a63fd91f0ca088cb8465772c755ac71e293b5cf016e516beadc5a0dead725ab","last_reissued_at":"2026-05-18T02:53:30.213214Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:53:30.213214Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Unavoidable vertex-minors in large prime graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"O-joung Kwon, Sang-il Oum","submitted_at":"2013-06-13T10:08:41Z","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."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.3066","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":"1306.3066","created_at":"2026-05-18T02:53:30.213350+00:00"},{"alias_kind":"arxiv_version","alias_value":"1306.3066v2","created_at":"2026-05-18T02:53:30.213350+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.3066","created_at":"2026-05-18T02:53:30.213350+00:00"},{"alias_kind":"pith_short_12","alias_value":"FJR73EPQZIEI","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_16","alias_value":"FJR73EPQZIEIZOCG","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_8","alias_value":"FJR73EPQ","created_at":"2026-05-18T12:27:45.050594+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/FJR73EPQZIEIZOCGK5ZMOVNMOH","json":"https://pith.science/pith/FJR73EPQZIEIZOCGK5ZMOVNMOH.json","graph_json":"https://pith.science/api/pith-number/FJR73EPQZIEIZOCGK5ZMOVNMOH/graph.json","events_json":"https://pith.science/api/pith-number/FJR73EPQZIEIZOCGK5ZMOVNMOH/events.json","paper":"https://pith.science/paper/FJR73EPQ"},"agent_actions":{"view_html":"https://pith.science/pith/FJR73EPQZIEIZOCGK5ZMOVNMOH","download_json":"https://pith.science/pith/FJR73EPQZIEIZOCGK5ZMOVNMOH.json","view_paper":"https://pith.science/paper/FJR73EPQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1306.3066&json=true","fetch_graph":"https://pith.science/api/pith-number/FJR73EPQZIEIZOCGK5ZMOVNMOH/graph.json","fetch_events":"https://pith.science/api/pith-number/FJR73EPQZIEIZOCGK5ZMOVNMOH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FJR73EPQZIEIZOCGK5ZMOVNMOH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FJR73EPQZIEIZOCGK5ZMOVNMOH/action/storage_attestation","attest_author":"https://pith.science/pith/FJR73EPQZIEIZOCGK5ZMOVNMOH/action/author_attestation","sign_citation":"https://pith.science/pith/FJR73EPQZIEIZOCGK5ZMOVNMOH/action/citation_signature","submit_replication":"https://pith.science/pith/FJR73EPQZIEIZOCGK5ZMOVNMOH/action/replication_record"}},"created_at":"2026-05-18T02:53:30.213350+00:00","updated_at":"2026-05-18T02:53:30.213350+00:00"}