{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:NWDJ5FSAW25QNNOF2EECKTTLLU","short_pith_number":"pith:NWDJ5FSA","schema_version":"1.0","canonical_sha256":"6d869e9640b6bb06b5c5d108254e6b5d2665d2bdc1cf9de22e92a31b8823ad11","source":{"kind":"arxiv","id":"1205.0991","version":5},"attestation_state":"computed","paper":{"title":"On the Complexity of Recognizing S-composite and S-prime Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.CC","authors_text":"Marc Hellmuth","submitted_at":"2012-05-04T15:49:05Z","abstract_excerpt":"S-prime graphs are graphs that cannot be represented as nontrivial subgraphs of nontrivial Cartesian products of graphs, i.e., whenever it is a subgraph of a nontrivial Cartesian product graph it is a subgraph of one the factors. A graph is S-composite if it is not S-prime. Although linear time recognition algorithms for determining whether a graph is prime or not with respect to the Cartesian product are known, it remained unknown if a similar result holds also for the recognition of S-prime and S-composite graphs.\n  In this contribution the computational complexity of recognizing S-composite"},"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":"1205.0991","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-05-04T15:49:05Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"304de42f4f6c81f4f13af14bdc1d558b52028888e96b1ce7dddf599d2ad5bd81","abstract_canon_sha256":"ea660ce8a22a5adcb69151533c4416bf347bc1c097ee362ddd6fa183977fcd53"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:46.450478Z","signature_b64":"1HScrhe9gMKC4ced2en1w//wTWawHdcNxjRQ3bcWQXY3g2OhX7m/LWeP2XAIow5fdqZ6v4I+j0U9m9148mZ3Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6d869e9640b6bb06b5c5d108254e6b5d2665d2bdc1cf9de22e92a31b8823ad11","last_reissued_at":"2026-05-18T00:44:46.449941Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:46.449941Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Complexity of Recognizing S-composite and S-prime Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.CC","authors_text":"Marc Hellmuth","submitted_at":"2012-05-04T15:49:05Z","abstract_excerpt":"S-prime graphs are graphs that cannot be represented as nontrivial subgraphs of nontrivial Cartesian products of graphs, i.e., whenever it is a subgraph of a nontrivial Cartesian product graph it is a subgraph of one the factors. A graph is S-composite if it is not S-prime. Although linear time recognition algorithms for determining whether a graph is prime or not with respect to the Cartesian product are known, it remained unknown if a similar result holds also for the recognition of S-prime and S-composite graphs.\n  In this contribution the computational complexity of recognizing S-composite"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.0991","kind":"arxiv","version":5},"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":"1205.0991","created_at":"2026-05-18T00:44:46.450021+00:00"},{"alias_kind":"arxiv_version","alias_value":"1205.0991v5","created_at":"2026-05-18T00:44:46.450021+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.0991","created_at":"2026-05-18T00:44:46.450021+00:00"},{"alias_kind":"pith_short_12","alias_value":"NWDJ5FSAW25Q","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_16","alias_value":"NWDJ5FSAW25QNNOF","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_8","alias_value":"NWDJ5FSA","created_at":"2026-05-18T12:27:16.716162+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/NWDJ5FSAW25QNNOF2EECKTTLLU","json":"https://pith.science/pith/NWDJ5FSAW25QNNOF2EECKTTLLU.json","graph_json":"https://pith.science/api/pith-number/NWDJ5FSAW25QNNOF2EECKTTLLU/graph.json","events_json":"https://pith.science/api/pith-number/NWDJ5FSAW25QNNOF2EECKTTLLU/events.json","paper":"https://pith.science/paper/NWDJ5FSA"},"agent_actions":{"view_html":"https://pith.science/pith/NWDJ5FSAW25QNNOF2EECKTTLLU","download_json":"https://pith.science/pith/NWDJ5FSAW25QNNOF2EECKTTLLU.json","view_paper":"https://pith.science/paper/NWDJ5FSA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1205.0991&json=true","fetch_graph":"https://pith.science/api/pith-number/NWDJ5FSAW25QNNOF2EECKTTLLU/graph.json","fetch_events":"https://pith.science/api/pith-number/NWDJ5FSAW25QNNOF2EECKTTLLU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NWDJ5FSAW25QNNOF2EECKTTLLU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NWDJ5FSAW25QNNOF2EECKTTLLU/action/storage_attestation","attest_author":"https://pith.science/pith/NWDJ5FSAW25QNNOF2EECKTTLLU/action/author_attestation","sign_citation":"https://pith.science/pith/NWDJ5FSAW25QNNOF2EECKTTLLU/action/citation_signature","submit_replication":"https://pith.science/pith/NWDJ5FSAW25QNNOF2EECKTTLLU/action/replication_record"}},"created_at":"2026-05-18T00:44:46.450021+00:00","updated_at":"2026-05-18T00:44:46.450021+00:00"}