{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:JLDYOZSI2P6BAOLQBKQ4BDC6A2","short_pith_number":"pith:JLDYOZSI","canonical_record":{"source":{"id":"1305.1824","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-05-08T14:12:38Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"cab9aa1b24dfe633a220a9e21c36493fd2831458dced96e1fa203fae9694469f","abstract_canon_sha256":"522743ca22cb2200f3a63bdb8612930be7b14c6c24f6167431893eae73a40828"},"schema_version":"1.0"},"canonical_sha256":"4ac7876648d3fc1039700aa1c08c5e06b3aa236c992d772921acc775f45a1261","source":{"kind":"arxiv","id":"1305.1824","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.1824","created_at":"2026-05-18T02:28:48Z"},{"alias_kind":"arxiv_version","alias_value":"1305.1824v1","created_at":"2026-05-18T02:28:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.1824","created_at":"2026-05-18T02:28:48Z"},{"alias_kind":"pith_short_12","alias_value":"JLDYOZSI2P6B","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"JLDYOZSI2P6BAOLQ","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"JLDYOZSI","created_at":"2026-05-18T12:27:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:JLDYOZSI2P6BAOLQBKQ4BDC6A2","target":"record","payload":{"canonical_record":{"source":{"id":"1305.1824","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-05-08T14:12:38Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"cab9aa1b24dfe633a220a9e21c36493fd2831458dced96e1fa203fae9694469f","abstract_canon_sha256":"522743ca22cb2200f3a63bdb8612930be7b14c6c24f6167431893eae73a40828"},"schema_version":"1.0"},"canonical_sha256":"4ac7876648d3fc1039700aa1c08c5e06b3aa236c992d772921acc775f45a1261","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:28:48.288216Z","signature_b64":"sQVshBJcYR+fyeBb50pXq9XrkjhoMltFbeC/TxPx6rDwPrN1JmMAzeEhl+Rjf4RlzI1hsrBD7X/HESCL00mVDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4ac7876648d3fc1039700aa1c08c5e06b3aa236c992d772921acc775f45a1261","last_reissued_at":"2026-05-18T02:28:48.287803Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:28:48.287803Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1305.1824","source_version":1,"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-18T02:28:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Pf+AvKRtQyWj/STD12f+oFoPUibimOvn1U3iRErCfWM9Vg8OinqkNZsAZ+EUACn4g5+02panVRO2GzqaxtqjCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T01:20:56.695150Z"},"content_sha256":"c034718fade51d76af885d80e7b631a9fe381d02b34e6dd37e5b15c6d80849b2","schema_version":"1.0","event_id":"sha256:c034718fade51d76af885d80e7b631a9fe381d02b34e6dd37e5b15c6d80849b2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:JLDYOZSI2P6BAOLQBKQ4BDC6A2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Strong Products of Hypergraphs: Unique Prime Factorization Theorems and Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Lydia Ostermeier, Manuel Noll, Marc Hellmuth","submitted_at":"2013-05-08T14:12:38Z","abstract_excerpt":"It is well-known that all finite connected graphs have a unique prime factor decomposition (PFD) with respect to the strong graph product which can be computed in polynomial time. Essential for the PFD computation is the construction of the so-called Cartesian skeleton of the graphs under investigation.\n  In this contribution, we show that every connected thin hypergraph H has a unique prime factorization with respect to the normal and strong (hypergraph) product. Both products coincide with the usual strong graph product whenever H is a graph. We introduce the notion of the Cartesian skeleton"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.1824","kind":"arxiv","version":1},"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-18T02:28:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NUOYmjI9YMa/EnGHVDXtN/ho5LyQiYGXXIGEatjU5TlfwjRcfkJneq/XETp/MaA1UICaP4bEYieIU/zhBOZhCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T01:20:56.695849Z"},"content_sha256":"9d0c2dcf83751e73461615e9add4a07b2afc1cbcd5761bc858a273e01bca2a77","schema_version":"1.0","event_id":"sha256:9d0c2dcf83751e73461615e9add4a07b2afc1cbcd5761bc858a273e01bca2a77"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JLDYOZSI2P6BAOLQBKQ4BDC6A2/bundle.json","state_url":"https://pith.science/pith/JLDYOZSI2P6BAOLQBKQ4BDC6A2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JLDYOZSI2P6BAOLQBKQ4BDC6A2/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-26T01:20:56Z","links":{"resolver":"https://pith.science/pith/JLDYOZSI2P6BAOLQBKQ4BDC6A2","bundle":"https://pith.science/pith/JLDYOZSI2P6BAOLQBKQ4BDC6A2/bundle.json","state":"https://pith.science/pith/JLDYOZSI2P6BAOLQBKQ4BDC6A2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JLDYOZSI2P6BAOLQBKQ4BDC6A2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:JLDYOZSI2P6BAOLQBKQ4BDC6A2","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":"522743ca22cb2200f3a63bdb8612930be7b14c6c24f6167431893eae73a40828","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-05-08T14:12:38Z","title_canon_sha256":"cab9aa1b24dfe633a220a9e21c36493fd2831458dced96e1fa203fae9694469f"},"schema_version":"1.0","source":{"id":"1305.1824","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.1824","created_at":"2026-05-18T02:28:48Z"},{"alias_kind":"arxiv_version","alias_value":"1305.1824v1","created_at":"2026-05-18T02:28:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.1824","created_at":"2026-05-18T02:28:48Z"},{"alias_kind":"pith_short_12","alias_value":"JLDYOZSI2P6B","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"JLDYOZSI2P6BAOLQ","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"JLDYOZSI","created_at":"2026-05-18T12:27:49Z"}],"graph_snapshots":[{"event_id":"sha256:9d0c2dcf83751e73461615e9add4a07b2afc1cbcd5761bc858a273e01bca2a77","target":"graph","created_at":"2026-05-18T02:28:48Z","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":"It is well-known that all finite connected graphs have a unique prime factor decomposition (PFD) with respect to the strong graph product which can be computed in polynomial time. Essential for the PFD computation is the construction of the so-called Cartesian skeleton of the graphs under investigation.\n  In this contribution, we show that every connected thin hypergraph H has a unique prime factorization with respect to the normal and strong (hypergraph) product. Both products coincide with the usual strong graph product whenever H is a graph. We introduce the notion of the Cartesian skeleton","authors_text":"Lydia Ostermeier, Manuel Noll, Marc Hellmuth","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-05-08T14:12:38Z","title":"Strong Products of Hypergraphs: Unique Prime Factorization Theorems and Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.1824","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:c034718fade51d76af885d80e7b631a9fe381d02b34e6dd37e5b15c6d80849b2","target":"record","created_at":"2026-05-18T02:28:48Z","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":"522743ca22cb2200f3a63bdb8612930be7b14c6c24f6167431893eae73a40828","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-05-08T14:12:38Z","title_canon_sha256":"cab9aa1b24dfe633a220a9e21c36493fd2831458dced96e1fa203fae9694469f"},"schema_version":"1.0","source":{"id":"1305.1824","kind":"arxiv","version":1}},"canonical_sha256":"4ac7876648d3fc1039700aa1c08c5e06b3aa236c992d772921acc775f45a1261","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4ac7876648d3fc1039700aa1c08c5e06b3aa236c992d772921acc775f45a1261","first_computed_at":"2026-05-18T02:28:48.287803Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:28:48.287803Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sQVshBJcYR+fyeBb50pXq9XrkjhoMltFbeC/TxPx6rDwPrN1JmMAzeEhl+Rjf4RlzI1hsrBD7X/HESCL00mVDg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:28:48.288216Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.1824","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c034718fade51d76af885d80e7b631a9fe381d02b34e6dd37e5b15c6d80849b2","sha256:9d0c2dcf83751e73461615e9add4a07b2afc1cbcd5761bc858a273e01bca2a77"],"state_sha256":"4e40b2699b0f59edeec201776fa4b2f1d868a7342ab0c2590705f1f618e1ee6e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Cf6/sQ35e6hipwQAww9Adxl8Vrin6NkvhdRRdyRFaMGRYmIeK+oB8jtHmMUpSYVgpBoE+4LovZwXAPG8sDcmBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T01:20:56.699468Z","bundle_sha256":"293cf08ce9632a1177959f3a500ecaa57514c18a6f2de91154242088e6a488d3"}}