{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:TFJU3NCVPRXS2Z4V3MBESE5U72","short_pith_number":"pith:TFJU3NCV","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"},"canonical_sha256":"99534db4557c6f2d6795db024913b4fe8305bf5f9dc8e868b88b84eb63aea0b6","source":{"kind":"arxiv","id":"1607.06864","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.06864","created_at":"2026-05-17T23:56:25Z"},{"alias_kind":"arxiv_version","alias_value":"1607.06864v2","created_at":"2026-05-17T23:56:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.06864","created_at":"2026-05-17T23:56:25Z"},{"alias_kind":"pith_short_12","alias_value":"TFJU3NCVPRXS","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"TFJU3NCVPRXS2Z4V","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"TFJU3NCV","created_at":"2026-05-18T12:30:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:TFJU3NCVPRXS2Z4V3MBESE5U72","target":"record","payload":{"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"},"canonical_sha256":"99534db4557c6f2d6795db024913b4fe8305bf5f9dc8e868b88b84eb63aea0b6","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"},"source_kind":"arxiv","source_id":"1607.06864","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-17T23:56:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OqwRIjF0++kS7KJqnpQ9SnG4aa8fw1U5QqVlYGetJg5ReezSOv+HWW7P1AeR9p3U3eXceBeDF2jb1bPVUsLdAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T22:58:31.718074Z"},"content_sha256":"ba3de6951e6fda38ec8a733b5567e13b727fe9313b4f1f8e8c9f402656b078d0","schema_version":"1.0","event_id":"sha256:ba3de6951e6fda38ec8a733b5567e13b727fe9313b4f1f8e8c9f402656b078d0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:TFJU3NCVPRXS2Z4V3MBESE5U72","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:56:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vFRmqB/1CdOaG6XgqSJ4W1BE+old2LMb+eoEJ8M3HZvmWi4rlVcURP21zt4E9lbW6xt/aK/nKJt7QSjfGLpyDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T22:58:31.718837Z"},"content_sha256":"9158466c74af24429720c7ad93f69db1f0d5bdd43805d62a3d29102fd18c3a01","schema_version":"1.0","event_id":"sha256:9158466c74af24429720c7ad93f69db1f0d5bdd43805d62a3d29102fd18c3a01"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TFJU3NCVPRXS2Z4V3MBESE5U72/bundle.json","state_url":"https://pith.science/pith/TFJU3NCVPRXS2Z4V3MBESE5U72/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TFJU3NCVPRXS2Z4V3MBESE5U72/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-10T22:58:31Z","links":{"resolver":"https://pith.science/pith/TFJU3NCVPRXS2Z4V3MBESE5U72","bundle":"https://pith.science/pith/TFJU3NCVPRXS2Z4V3MBESE5U72/bundle.json","state":"https://pith.science/pith/TFJU3NCVPRXS2Z4V3MBESE5U72/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TFJU3NCVPRXS2Z4V3MBESE5U72/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:TFJU3NCVPRXS2Z4V3MBESE5U72","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":"43c37b30f64327776b4afdc680ae308a5de9b3beabcfea196031d61804dcddd5","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-07-23T00:08:22Z","title_canon_sha256":"dbf3eb24eca8db627e28dd238e07ec810e59fc5b9dc9a5165ab2980ec3f7da38"},"schema_version":"1.0","source":{"id":"1607.06864","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.06864","created_at":"2026-05-17T23:56:25Z"},{"alias_kind":"arxiv_version","alias_value":"1607.06864v2","created_at":"2026-05-17T23:56:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.06864","created_at":"2026-05-17T23:56:25Z"},{"alias_kind":"pith_short_12","alias_value":"TFJU3NCVPRXS","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"TFJU3NCVPRXS2Z4V","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"TFJU3NCV","created_at":"2026-05-18T12:30:44Z"}],"graph_snapshots":[{"event_id":"sha256:9158466c74af24429720c7ad93f69db1f0d5bdd43805d62a3d29102fd18c3a01","target":"graph","created_at":"2026-05-17T23:56:25Z","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 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.","authors_text":"Hojin Choi, Jisu Jeong, Robert Brignall, Sang-il Oum","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-07-23T00:08:22Z","title":"Deciding whether there are infinitely many prime graphs with forbidden induced subgraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.06864","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:ba3de6951e6fda38ec8a733b5567e13b727fe9313b4f1f8e8c9f402656b078d0","target":"record","created_at":"2026-05-17T23:56:25Z","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":"43c37b30f64327776b4afdc680ae308a5de9b3beabcfea196031d61804dcddd5","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-07-23T00:08:22Z","title_canon_sha256":"dbf3eb24eca8db627e28dd238e07ec810e59fc5b9dc9a5165ab2980ec3f7da38"},"schema_version":"1.0","source":{"id":"1607.06864","kind":"arxiv","version":2}},"canonical_sha256":"99534db4557c6f2d6795db024913b4fe8305bf5f9dc8e868b88b84eb63aea0b6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"99534db4557c6f2d6795db024913b4fe8305bf5f9dc8e868b88b84eb63aea0b6","first_computed_at":"2026-05-17T23:56:25.364417Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:56:25.364417Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eeXDw4ssdNytPffyL6bxdRum+CBmoUCM2HjXa8ZEP86mQR7dWPjzTI1RBVjw9DTX2UUqa0f5a97DygjnJ8LZCg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:56:25.364997Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.06864","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ba3de6951e6fda38ec8a733b5567e13b727fe9313b4f1f8e8c9f402656b078d0","sha256:9158466c74af24429720c7ad93f69db1f0d5bdd43805d62a3d29102fd18c3a01"],"state_sha256":"b3ec7a866d3a341d89f28633ee11174f1739380976a0dc66057e0326afb2ddb7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1ubbSUQiR2gjB3458qOapRaY6SxKbTWGhFZZrgA7O7EpYBm+HCFUrKxmnICYQDrMMQonm8Vcmi1v7wQXCUIZDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T22:58:31.723182Z","bundle_sha256":"863c05f4ae6b3fd184b46b3d0da0aee5c27d0f3142203188cf803c92c459612f"}}