{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:KERIGXEMXABRD2TR4V4VKVU3E3","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":"77c426244ee5a84615484ad6958540f65b24b35f5ad8f326472e1542ae93b33b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-11-25T14:54:31Z","title_canon_sha256":"50ef230ebb4b0349c814265fe3badad7bf4471dd088f9a991e4b122501cac3ba"},"schema_version":"1.0","source":{"id":"1411.6887","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.6887","created_at":"2026-05-18T02:32:47Z"},{"alias_kind":"arxiv_version","alias_value":"1411.6887v1","created_at":"2026-05-18T02:32:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.6887","created_at":"2026-05-18T02:32:47Z"},{"alias_kind":"pith_short_12","alias_value":"KERIGXEMXABR","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"KERIGXEMXABRD2TR","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"KERIGXEM","created_at":"2026-05-18T12:28:35Z"}],"graph_snapshots":[{"event_id":"sha256:f3ff1e539ad6a73718a3f72b0a9b94771a3f415cd9ad01f3448508ecf5321bf6","target":"graph","created_at":"2026-05-18T02:32:47Z","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":"We extend the definition of the Cartesian product to graphs with loops and show that the Sabidussi-Vizing unique factorization theorem for connected finite simple graphs still holds in this context for all connected finite graphs with at least one unlooped vertex. We also prove that this factorization can be computed in O(m) time, where m is the number of edges of the given graph.","authors_text":"Christiaan E. van de Woestijne, Florian Lehner, Johannes Cuno, Tetiana Boiko, Wilfried Imrich","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-11-25T14:54:31Z","title":"The Cartesian product of graphs with loops"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.6887","kind":"arxiv","version":1},"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:f86712fa6536e34d999bdced134eebeb2dba9d909ad3beacb13f359a3a706efb","target":"record","created_at":"2026-05-18T02:32:47Z","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":"77c426244ee5a84615484ad6958540f65b24b35f5ad8f326472e1542ae93b33b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-11-25T14:54:31Z","title_canon_sha256":"50ef230ebb4b0349c814265fe3badad7bf4471dd088f9a991e4b122501cac3ba"},"schema_version":"1.0","source":{"id":"1411.6887","kind":"arxiv","version":1}},"canonical_sha256":"5122835c8cb80311ea71e57955569b26ffc186947d3e883d7cef018d8a061481","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5122835c8cb80311ea71e57955569b26ffc186947d3e883d7cef018d8a061481","first_computed_at":"2026-05-18T02:32:47.070782Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:32:47.070782Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uHCL0xj91lu9gGraMAkCzIlpJE5gAMmmXrbC5/idhIETEnSVtWvK/wAoDdbcTGECD4SiTajnJ8e3B3OhjdEWDA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:32:47.071385Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.6887","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f86712fa6536e34d999bdced134eebeb2dba9d909ad3beacb13f359a3a706efb","sha256:f3ff1e539ad6a73718a3f72b0a9b94771a3f415cd9ad01f3448508ecf5321bf6"],"state_sha256":"a567375d2ec4f60c50e665e85d03c7dae716a3852eda3f9b7f29762403bd8005"}