{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:JJMLD2VW4T357YOZIA75G7IL4C","short_pith_number":"pith:JJMLD2VW","schema_version":"1.0","canonical_sha256":"4a58b1eab6e4f7dfe1d9403fd37d0be0a34447253c1002b12ec762637e963386","source":{"kind":"arxiv","id":"1404.4342","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1404.4342","created_at":"2026-05-18T00:49:04.979525+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.4342v1","created_at":"2026-05-18T00:49:04.979525+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.4342","created_at":"2026-05-18T00:49:04.979525+00:00"},{"alias_kind":"pith_short_12","alias_value":"JJMLD2VW4T35","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_16","alias_value":"JJMLD2VW4T357YOZ","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_8","alias_value":"JJMLD2VW","created_at":"2026-05-18T12:28:33.132498+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/JJMLD2VW4T357YOZIA75G7IL4C","json":"https://pith.science/pith/JJMLD2VW4T357YOZIA75G7IL4C.json","graph_json":"https://pith.science/api/pith-number/JJMLD2VW4T357YOZIA75G7IL4C/graph.json","events_json":"https://pith.science/api/pith-number/JJMLD2VW4T357YOZIA75G7IL4C/events.json","paper":"https://pith.science/paper/JJMLD2VW"},"agent_actions":{"view_html":"https://pith.science/pith/JJMLD2VW4T357YOZIA75G7IL4C","download_json":"https://pith.science/pith/JJMLD2VW4T357YOZIA75G7IL4C.json","view_paper":"https://pith.science/paper/JJMLD2VW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.4342&json=true","fetch_graph":"https://pith.science/api/pith-number/JJMLD2VW4T357YOZIA75G7IL4C/graph.json","fetch_events":"https://pith.science/api/pith-number/JJMLD2VW4T357YOZIA75G7IL4C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JJMLD2VW4T357YOZIA75G7IL4C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JJMLD2VW4T357YOZIA75G7IL4C/action/storage_attestation","attest_author":"https://pith.science/pith/JJMLD2VW4T357YOZIA75G7IL4C/action/author_attestation","sign_citation":"https://pith.science/pith/JJMLD2VW4T357YOZIA75G7IL4C/action/citation_signature","submit_replication":"https://pith.science/pith/JJMLD2VW4T357YOZIA75G7IL4C/action/replication_record"}},"created_at":"2026-05-18T00:49:04.979525+00:00","updated_at":"2026-05-18T00:49:04.979525+00:00"}