{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:NWDJ5FSAW25QNNOF2EECKTTLLU","short_pith_number":"pith:NWDJ5FSA","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"},"canonical_sha256":"6d869e9640b6bb06b5c5d108254e6b5d2665d2bdc1cf9de22e92a31b8823ad11","source":{"kind":"arxiv","id":"1205.0991","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.0991","created_at":"2026-05-18T00:44:46Z"},{"alias_kind":"arxiv_version","alias_value":"1205.0991v5","created_at":"2026-05-18T00:44:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.0991","created_at":"2026-05-18T00:44:46Z"},{"alias_kind":"pith_short_12","alias_value":"NWDJ5FSAW25Q","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"NWDJ5FSAW25QNNOF","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"NWDJ5FSA","created_at":"2026-05-18T12:27:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:NWDJ5FSAW25QNNOF2EECKTTLLU","target":"record","payload":{"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"},"canonical_sha256":"6d869e9640b6bb06b5c5d108254e6b5d2665d2bdc1cf9de22e92a31b8823ad11","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"},"source_kind":"arxiv","source_id":"1205.0991","source_version":5,"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-18T00:44:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+uzRZTVCUYkfBK3d0tXvdDfAXS7fSXMlWlqV5kJxq82dXvvTu2VI+UMimCJPRF1gGHY6NnMvn9yHajTD2QFPCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:59:48.079735Z"},"content_sha256":"84561f5c9bca6aeff13c3a7a1131908f6f72d4136432fb512466ee50ea998ae6","schema_version":"1.0","event_id":"sha256:84561f5c9bca6aeff13c3a7a1131908f6f72d4136432fb512466ee50ea998ae6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:NWDJ5FSAW25QNNOF2EECKTTLLU","target":"graph","payload":{"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"},"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-18T00:44:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g37xT4LrCgGXEdJEK1e1XrJTF+BOF9lG5Rc8+elN6iYgp8jmXrZYuSJN1rEVSHfaHbyUHqwbdOJLtvlUzCtHBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:59:48.080206Z"},"content_sha256":"51e25454b1c9f50410bf25cd497ba20a4a654243f80f4c3b217a50057b4407fd","schema_version":"1.0","event_id":"sha256:51e25454b1c9f50410bf25cd497ba20a4a654243f80f4c3b217a50057b4407fd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NWDJ5FSAW25QNNOF2EECKTTLLU/bundle.json","state_url":"https://pith.science/pith/NWDJ5FSAW25QNNOF2EECKTTLLU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NWDJ5FSAW25QNNOF2EECKTTLLU/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-05-25T18:59:48Z","links":{"resolver":"https://pith.science/pith/NWDJ5FSAW25QNNOF2EECKTTLLU","bundle":"https://pith.science/pith/NWDJ5FSAW25QNNOF2EECKTTLLU/bundle.json","state":"https://pith.science/pith/NWDJ5FSAW25QNNOF2EECKTTLLU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NWDJ5FSAW25QNNOF2EECKTTLLU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:NWDJ5FSAW25QNNOF2EECKTTLLU","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":"ea660ce8a22a5adcb69151533c4416bf347bc1c097ee362ddd6fa183977fcd53","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-05-04T15:49:05Z","title_canon_sha256":"304de42f4f6c81f4f13af14bdc1d558b52028888e96b1ce7dddf599d2ad5bd81"},"schema_version":"1.0","source":{"id":"1205.0991","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.0991","created_at":"2026-05-18T00:44:46Z"},{"alias_kind":"arxiv_version","alias_value":"1205.0991v5","created_at":"2026-05-18T00:44:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.0991","created_at":"2026-05-18T00:44:46Z"},{"alias_kind":"pith_short_12","alias_value":"NWDJ5FSAW25Q","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"NWDJ5FSAW25QNNOF","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"NWDJ5FSA","created_at":"2026-05-18T12:27:16Z"}],"graph_snapshots":[{"event_id":"sha256:51e25454b1c9f50410bf25cd497ba20a4a654243f80f4c3b217a50057b4407fd","target":"graph","created_at":"2026-05-18T00:44:46Z","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":"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","authors_text":"Marc Hellmuth","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-05-04T15:49:05Z","title":"On the Complexity of Recognizing S-composite and S-prime Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.0991","kind":"arxiv","version":5},"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:84561f5c9bca6aeff13c3a7a1131908f6f72d4136432fb512466ee50ea998ae6","target":"record","created_at":"2026-05-18T00:44:46Z","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":"ea660ce8a22a5adcb69151533c4416bf347bc1c097ee362ddd6fa183977fcd53","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-05-04T15:49:05Z","title_canon_sha256":"304de42f4f6c81f4f13af14bdc1d558b52028888e96b1ce7dddf599d2ad5bd81"},"schema_version":"1.0","source":{"id":"1205.0991","kind":"arxiv","version":5}},"canonical_sha256":"6d869e9640b6bb06b5c5d108254e6b5d2665d2bdc1cf9de22e92a31b8823ad11","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6d869e9640b6bb06b5c5d108254e6b5d2665d2bdc1cf9de22e92a31b8823ad11","first_computed_at":"2026-05-18T00:44:46.449941Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:44:46.449941Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1HScrhe9gMKC4ced2en1w//wTWawHdcNxjRQ3bcWQXY3g2OhX7m/LWeP2XAIow5fdqZ6v4I+j0U9m9148mZ3Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:44:46.450478Z","signed_message":"canonical_sha256_bytes"},"source_id":"1205.0991","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:84561f5c9bca6aeff13c3a7a1131908f6f72d4136432fb512466ee50ea998ae6","sha256:51e25454b1c9f50410bf25cd497ba20a4a654243f80f4c3b217a50057b4407fd"],"state_sha256":"f99b42c46653321c1be5124f3853e93543518baf4ef706dc9a8d79b9ec00e182"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NvfUxYAZrTJuRzEwUAkKM9eT42oaCel4z+JcPdNbRZ9h2p/x0OKuTBTUxtVLvOd1jV5aTEAM6ChxWBB0HnE8Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T18:59:48.083415Z","bundle_sha256":"9a0c120b542ba41c42923603e820d1078eaa1b11dd11f2c59b4ea0a6ac3a96de"}}