{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:TFJU3NCVPRXS2Z4V3MBESE5U72","short_pith_number":"pith:TFJU3NCV","schema_version":"1.0","canonical_sha256":"99534db4557c6f2d6795db024913b4fe8305bf5f9dc8e868b88b84eb63aea0b6","source":{"kind":"arxiv","id":"1607.06864","version":2},"attestation_state":"computed","paper":{"title":"Deciding whether there are infinitely many prime graphs with forbidden induced subgraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Hojin Choi, Jisu Jeong, Robert Brignall, Sang-il Oum","submitted_at":"2016-07-23T00:08:22Z","abstract_excerpt":"A homogeneous set of a graph $G$ is a set $X$ of vertices such that $2\\le \\lvert X\\rvert <\\lvert V(G)\\rvert$ and no vertex in $V(G)-X$ has both a neighbor and a non-neighbor in $X$. A graph is prime if it has no homogeneous set.\n  We present an algorithm to decide whether a class of graphs given by a finite set of forbidden induced subgraphs contains infinitely many non-isomorphic prime graphs."},"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":"1607.06864","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-07-23T00:08:22Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"dbf3eb24eca8db627e28dd238e07ec810e59fc5b9dc9a5165ab2980ec3f7da38","abstract_canon_sha256":"43c37b30f64327776b4afdc680ae308a5de9b3beabcfea196031d61804dcddd5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:25.364997Z","signature_b64":"eeXDw4ssdNytPffyL6bxdRum+CBmoUCM2HjXa8ZEP86mQR7dWPjzTI1RBVjw9DTX2UUqa0f5a97DygjnJ8LZCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"99534db4557c6f2d6795db024913b4fe8305bf5f9dc8e868b88b84eb63aea0b6","last_reissued_at":"2026-05-17T23:56:25.364417Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:25.364417Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deciding whether there are infinitely many prime graphs with forbidden induced subgraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Hojin Choi, Jisu Jeong, Robert Brignall, Sang-il Oum","submitted_at":"2016-07-23T00:08:22Z","abstract_excerpt":"A homogeneous set of a graph $G$ is a set $X$ of vertices such that $2\\le \\lvert X\\rvert <\\lvert V(G)\\rvert$ and no vertex in $V(G)-X$ has both a neighbor and a non-neighbor in $X$. A graph is prime if it has no homogeneous set.\n  We present an algorithm to decide whether a class of graphs given by a finite set of forbidden induced subgraphs contains infinitely many non-isomorphic prime graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.06864","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":"1607.06864","created_at":"2026-05-17T23:56:25.364499+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.06864v2","created_at":"2026-05-17T23:56:25.364499+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.06864","created_at":"2026-05-17T23:56:25.364499+00:00"},{"alias_kind":"pith_short_12","alias_value":"TFJU3NCVPRXS","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_16","alias_value":"TFJU3NCVPRXS2Z4V","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_8","alias_value":"TFJU3NCV","created_at":"2026-05-18T12:30:44.179134+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/TFJU3NCVPRXS2Z4V3MBESE5U72","json":"https://pith.science/pith/TFJU3NCVPRXS2Z4V3MBESE5U72.json","graph_json":"https://pith.science/api/pith-number/TFJU3NCVPRXS2Z4V3MBESE5U72/graph.json","events_json":"https://pith.science/api/pith-number/TFJU3NCVPRXS2Z4V3MBESE5U72/events.json","paper":"https://pith.science/paper/TFJU3NCV"},"agent_actions":{"view_html":"https://pith.science/pith/TFJU3NCVPRXS2Z4V3MBESE5U72","download_json":"https://pith.science/pith/TFJU3NCVPRXS2Z4V3MBESE5U72.json","view_paper":"https://pith.science/paper/TFJU3NCV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.06864&json=true","fetch_graph":"https://pith.science/api/pith-number/TFJU3NCVPRXS2Z4V3MBESE5U72/graph.json","fetch_events":"https://pith.science/api/pith-number/TFJU3NCVPRXS2Z4V3MBESE5U72/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TFJU3NCVPRXS2Z4V3MBESE5U72/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TFJU3NCVPRXS2Z4V3MBESE5U72/action/storage_attestation","attest_author":"https://pith.science/pith/TFJU3NCVPRXS2Z4V3MBESE5U72/action/author_attestation","sign_citation":"https://pith.science/pith/TFJU3NCVPRXS2Z4V3MBESE5U72/action/citation_signature","submit_replication":"https://pith.science/pith/TFJU3NCVPRXS2Z4V3MBESE5U72/action/replication_record"}},"created_at":"2026-05-17T23:56:25.364499+00:00","updated_at":"2026-05-17T23:56:25.364499+00:00"}