{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:JJMLD2VW4T357YOZIA75G7IL4C","short_pith_number":"pith:JJMLD2VW","canonical_record":{"source":{"id":"1404.4342","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-04-16T18:48:12Z","cross_cats_sorted":[],"title_canon_sha256":"1a328e8677d1372e39699cb275b6e129065dffa45ed39b64193bfdc9251a473e","abstract_canon_sha256":"f252c4b61296eab572044248823be847a475484ebcb047bad23d0e331e09fd0c"},"schema_version":"1.0"},"canonical_sha256":"4a58b1eab6e4f7dfe1d9403fd37d0be0a34447253c1002b12ec762637e963386","source":{"kind":"arxiv","id":"1404.4342","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.4342","created_at":"2026-05-18T00:49:04Z"},{"alias_kind":"arxiv_version","alias_value":"1404.4342v1","created_at":"2026-05-18T00:49:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.4342","created_at":"2026-05-18T00:49:04Z"},{"alias_kind":"pith_short_12","alias_value":"JJMLD2VW4T35","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"JJMLD2VW4T357YOZ","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"JJMLD2VW","created_at":"2026-05-18T12:28:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:JJMLD2VW4T357YOZIA75G7IL4C","target":"record","payload":{"canonical_record":{"source":{"id":"1404.4342","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-04-16T18:48:12Z","cross_cats_sorted":[],"title_canon_sha256":"1a328e8677d1372e39699cb275b6e129065dffa45ed39b64193bfdc9251a473e","abstract_canon_sha256":"f252c4b61296eab572044248823be847a475484ebcb047bad23d0e331e09fd0c"},"schema_version":"1.0"},"canonical_sha256":"4a58b1eab6e4f7dfe1d9403fd37d0be0a34447253c1002b12ec762637e963386","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:04.979916Z","signature_b64":"z7QzfRHzJyCENwNJOcoxE7FyuFt5aTowbgFGRHrZojBKsxxPYqob5+zR7EkWoIRaywjw2XhHTVZfZjdQ03huCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4a58b1eab6e4f7dfe1d9403fd37d0be0a34447253c1002b12ec762637e963386","last_reissued_at":"2026-05-18T00:49:04.979458Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:04.979458Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1404.4342","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-18T00:49:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SCiTKmK6v+59DjJvm0iPh79pSfYwI1o7CAEpPqeGQ+d9RbRKdCGhQRq/kKgd6JRiHcvYEoicvhYwW3gtYD0ICA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T05:08:43.033634Z"},"content_sha256":"0ba680c3bf43706f9072ca0cb6759f23b2d56c3f5c94b62ba360bff451d9279d","schema_version":"1.0","event_id":"sha256:0ba680c3bf43706f9072ca0cb6759f23b2d56c3f5c94b62ba360bff451d9279d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:JJMLD2VW4T357YOZIA75G7IL4C","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Connectedness and isomorphism properties of the zig-zag product of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alfredo Donno, Daniele D'Angeli, Ecaterina Sava-Huss","submitted_at":"2014-04-16T18:48:12Z","abstract_excerpt":"In this paper we investigate the connectedness and the isomorphism problems for zig-zag products of two graphs. A sufficient condition for the zig-zag product of two graphs to be connected is provided, reducing to the study of the connectedness property of a new graph which depends only on the second factor of the graph product. We show that, when the second factor is a cycle graph, the study of the isomorphism problem for the zig-zag product is equivalent to the study of the same problem for the associated pseudo-replacement graph. The latter is defined in a natural way, by a construction gen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.4342","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-18T00:49:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XemP5U1PVfTKkmKa4U7c1Qfsm6blcrQTiJdZSdo5mbg0rCgIeIxzWrpwJnr/N/IHJC4cDivUQS3Ub7DoNH1uCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T05:08:43.033989Z"},"content_sha256":"114aa06fba53788ac754f8e0ec7d90ccf671803f6beb372ddd270d02d075ae5e","schema_version":"1.0","event_id":"sha256:114aa06fba53788ac754f8e0ec7d90ccf671803f6beb372ddd270d02d075ae5e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JJMLD2VW4T357YOZIA75G7IL4C/bundle.json","state_url":"https://pith.science/pith/JJMLD2VW4T357YOZIA75G7IL4C/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JJMLD2VW4T357YOZIA75G7IL4C/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-02T05:08:43Z","links":{"resolver":"https://pith.science/pith/JJMLD2VW4T357YOZIA75G7IL4C","bundle":"https://pith.science/pith/JJMLD2VW4T357YOZIA75G7IL4C/bundle.json","state":"https://pith.science/pith/JJMLD2VW4T357YOZIA75G7IL4C/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JJMLD2VW4T357YOZIA75G7IL4C/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:JJMLD2VW4T357YOZIA75G7IL4C","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":"f252c4b61296eab572044248823be847a475484ebcb047bad23d0e331e09fd0c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-04-16T18:48:12Z","title_canon_sha256":"1a328e8677d1372e39699cb275b6e129065dffa45ed39b64193bfdc9251a473e"},"schema_version":"1.0","source":{"id":"1404.4342","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.4342","created_at":"2026-05-18T00:49:04Z"},{"alias_kind":"arxiv_version","alias_value":"1404.4342v1","created_at":"2026-05-18T00:49:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.4342","created_at":"2026-05-18T00:49:04Z"},{"alias_kind":"pith_short_12","alias_value":"JJMLD2VW4T35","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"JJMLD2VW4T357YOZ","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"JJMLD2VW","created_at":"2026-05-18T12:28:33Z"}],"graph_snapshots":[{"event_id":"sha256:114aa06fba53788ac754f8e0ec7d90ccf671803f6beb372ddd270d02d075ae5e","target":"graph","created_at":"2026-05-18T00:49:04Z","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":"In this paper we investigate the connectedness and the isomorphism problems for zig-zag products of two graphs. A sufficient condition for the zig-zag product of two graphs to be connected is provided, reducing to the study of the connectedness property of a new graph which depends only on the second factor of the graph product. We show that, when the second factor is a cycle graph, the study of the isomorphism problem for the zig-zag product is equivalent to the study of the same problem for the associated pseudo-replacement graph. The latter is defined in a natural way, by a construction gen","authors_text":"Alfredo Donno, Daniele D'Angeli, Ecaterina Sava-Huss","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-04-16T18:48:12Z","title":"Connectedness and isomorphism properties of the zig-zag product of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.4342","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:0ba680c3bf43706f9072ca0cb6759f23b2d56c3f5c94b62ba360bff451d9279d","target":"record","created_at":"2026-05-18T00:49:04Z","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":"f252c4b61296eab572044248823be847a475484ebcb047bad23d0e331e09fd0c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-04-16T18:48:12Z","title_canon_sha256":"1a328e8677d1372e39699cb275b6e129065dffa45ed39b64193bfdc9251a473e"},"schema_version":"1.0","source":{"id":"1404.4342","kind":"arxiv","version":1}},"canonical_sha256":"4a58b1eab6e4f7dfe1d9403fd37d0be0a34447253c1002b12ec762637e963386","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4a58b1eab6e4f7dfe1d9403fd37d0be0a34447253c1002b12ec762637e963386","first_computed_at":"2026-05-18T00:49:04.979458Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:49:04.979458Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"z7QzfRHzJyCENwNJOcoxE7FyuFt5aTowbgFGRHrZojBKsxxPYqob5+zR7EkWoIRaywjw2XhHTVZfZjdQ03huCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:49:04.979916Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.4342","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0ba680c3bf43706f9072ca0cb6759f23b2d56c3f5c94b62ba360bff451d9279d","sha256:114aa06fba53788ac754f8e0ec7d90ccf671803f6beb372ddd270d02d075ae5e"],"state_sha256":"5961f4715300204c4aa15d5e7e08695766aaf67324510470e549a2f176dfa6a0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aHtGQ8V2drcJ35zdkpK7FB+n6OGZBqEkTRP5j0Zw8HLptzz5HuYRCY+YLLpBgE9sg0MMiznMejNE5rdI3n4uAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T05:08:43.035950Z","bundle_sha256":"5b153602ff6ed53dae406bb148bb267f38b9f33e733e24123ae4276f5a7c078d"}}