{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:OTI2QWBH3OA6RH6FRF5VY74MS6","short_pith_number":"pith:OTI2QWBH","canonical_record":{"source":{"id":"1002.1033","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-02-04T16:26:48Z","cross_cats_sorted":[],"title_canon_sha256":"e11f878506d33839dce4cebff8660e1e8cc4d9e095196dfb1ac7607a6ede666f","abstract_canon_sha256":"65ea528bdedf0c3fecb09305f1aeeb09890e36521dc328f2197fb5e4a02d2844"},"schema_version":"1.0"},"canonical_sha256":"74d1a85827db81e89fc5897b5c7f8c9786fec0d4dac97a225e7e1253e8148a32","source":{"kind":"arxiv","id":"1002.1033","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1002.1033","created_at":"2026-05-18T02:29:44Z"},{"alias_kind":"arxiv_version","alias_value":"1002.1033v1","created_at":"2026-05-18T02:29:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1002.1033","created_at":"2026-05-18T02:29:44Z"},{"alias_kind":"pith_short_12","alias_value":"OTI2QWBH3OA6","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"OTI2QWBH3OA6RH6F","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"OTI2QWBH","created_at":"2026-05-18T12:26:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:OTI2QWBH3OA6RH6FRF5VY74MS6","target":"record","payload":{"canonical_record":{"source":{"id":"1002.1033","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-02-04T16:26:48Z","cross_cats_sorted":[],"title_canon_sha256":"e11f878506d33839dce4cebff8660e1e8cc4d9e095196dfb1ac7607a6ede666f","abstract_canon_sha256":"65ea528bdedf0c3fecb09305f1aeeb09890e36521dc328f2197fb5e4a02d2844"},"schema_version":"1.0"},"canonical_sha256":"74d1a85827db81e89fc5897b5c7f8c9786fec0d4dac97a225e7e1253e8148a32","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:29:44.479752Z","signature_b64":"FiFkBBImzGUUE87+u0X4hta8e3ORbV+3WITrvUl5d5KgqjVPzKtsfEEAOmVl3JCgV95wwWItmWieAQD+0WfvAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"74d1a85827db81e89fc5897b5c7f8c9786fec0d4dac97a225e7e1253e8148a32","last_reissued_at":"2026-05-18T02:29:44.479293Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:29:44.479293Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1002.1033","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:29:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GewfeZLTcMLz4buNx+x1eN6tAmaKSqF8vuAJtfOLE3dVKUuHiPfnHrzo2KKxMZ6Wqvcf+qYv7hRwlc9LzhPyCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T18:22:36.829710Z"},"content_sha256":"8fe5e7d9c40f52df0eb9d14f462ff6218685dce2ce102b8a1af47e7a3ddffb80","schema_version":"1.0","event_id":"sha256:8fe5e7d9c40f52df0eb9d14f462ff6218685dce2ce102b8a1af47e7a3ddffb80"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:OTI2QWBH3OA6RH6FRF5VY74MS6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Pseudo and Strongly Pseudo 2--Factor Isomorphic Regular Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"D. Labbate, J. Sheehan, M. Abreu","submitted_at":"2010-02-04T16:26:48Z","abstract_excerpt":"A graph $G$ is pseudo 2--factor isomorphic if the parity of the number of cycles in a 2--factor is the same for all 2--factors of $G$. In \\cite{ADJLS} we proved that pseudo 2--factor isomorphic $k$--regular bipartite graphs exist only for $k \\le 3$. In this paper we generalize this result for regular graphs which are not necessarily bipartite. We also introduce strongly pseudo 2--factor isomorphic graphs and we prove that pseudo and strongly pseudo 2--factor isomorphic 2k--regular graphs and $k$--regular digraphs do not exist for $k\\geq 4$. Moreover, we present constructions of infinite famili"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1002.1033","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:29:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+0yfvgszTvWuiK9vT4t+5Y0Oaz0N3AsZbbfsid+/O5npt9FyapIRUNLTGNnKB0vm59NsG8O39beBnr9XrlrSBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T18:22:36.830062Z"},"content_sha256":"70a20611b97adc4e07490d8bc0e35f16355516eb05d83245c479f88ccf8a7439","schema_version":"1.0","event_id":"sha256:70a20611b97adc4e07490d8bc0e35f16355516eb05d83245c479f88ccf8a7439"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OTI2QWBH3OA6RH6FRF5VY74MS6/bundle.json","state_url":"https://pith.science/pith/OTI2QWBH3OA6RH6FRF5VY74MS6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OTI2QWBH3OA6RH6FRF5VY74MS6/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-07-02T18:22:36Z","links":{"resolver":"https://pith.science/pith/OTI2QWBH3OA6RH6FRF5VY74MS6","bundle":"https://pith.science/pith/OTI2QWBH3OA6RH6FRF5VY74MS6/bundle.json","state":"https://pith.science/pith/OTI2QWBH3OA6RH6FRF5VY74MS6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OTI2QWBH3OA6RH6FRF5VY74MS6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:OTI2QWBH3OA6RH6FRF5VY74MS6","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":"65ea528bdedf0c3fecb09305f1aeeb09890e36521dc328f2197fb5e4a02d2844","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-02-04T16:26:48Z","title_canon_sha256":"e11f878506d33839dce4cebff8660e1e8cc4d9e095196dfb1ac7607a6ede666f"},"schema_version":"1.0","source":{"id":"1002.1033","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1002.1033","created_at":"2026-05-18T02:29:44Z"},{"alias_kind":"arxiv_version","alias_value":"1002.1033v1","created_at":"2026-05-18T02:29:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1002.1033","created_at":"2026-05-18T02:29:44Z"},{"alias_kind":"pith_short_12","alias_value":"OTI2QWBH3OA6","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"OTI2QWBH3OA6RH6F","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"OTI2QWBH","created_at":"2026-05-18T12:26:12Z"}],"graph_snapshots":[{"event_id":"sha256:70a20611b97adc4e07490d8bc0e35f16355516eb05d83245c479f88ccf8a7439","target":"graph","created_at":"2026-05-18T02:29:44Z","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":"A graph $G$ is pseudo 2--factor isomorphic if the parity of the number of cycles in a 2--factor is the same for all 2--factors of $G$. In \\cite{ADJLS} we proved that pseudo 2--factor isomorphic $k$--regular bipartite graphs exist only for $k \\le 3$. In this paper we generalize this result for regular graphs which are not necessarily bipartite. We also introduce strongly pseudo 2--factor isomorphic graphs and we prove that pseudo and strongly pseudo 2--factor isomorphic 2k--regular graphs and $k$--regular digraphs do not exist for $k\\geq 4$. Moreover, we present constructions of infinite famili","authors_text":"D. Labbate, J. Sheehan, M. Abreu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-02-04T16:26:48Z","title":"Pseudo and Strongly Pseudo 2--Factor Isomorphic Regular Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1002.1033","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:8fe5e7d9c40f52df0eb9d14f462ff6218685dce2ce102b8a1af47e7a3ddffb80","target":"record","created_at":"2026-05-18T02:29:44Z","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":"65ea528bdedf0c3fecb09305f1aeeb09890e36521dc328f2197fb5e4a02d2844","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-02-04T16:26:48Z","title_canon_sha256":"e11f878506d33839dce4cebff8660e1e8cc4d9e095196dfb1ac7607a6ede666f"},"schema_version":"1.0","source":{"id":"1002.1033","kind":"arxiv","version":1}},"canonical_sha256":"74d1a85827db81e89fc5897b5c7f8c9786fec0d4dac97a225e7e1253e8148a32","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"74d1a85827db81e89fc5897b5c7f8c9786fec0d4dac97a225e7e1253e8148a32","first_computed_at":"2026-05-18T02:29:44.479293Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:29:44.479293Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FiFkBBImzGUUE87+u0X4hta8e3ORbV+3WITrvUl5d5KgqjVPzKtsfEEAOmVl3JCgV95wwWItmWieAQD+0WfvAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:29:44.479752Z","signed_message":"canonical_sha256_bytes"},"source_id":"1002.1033","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8fe5e7d9c40f52df0eb9d14f462ff6218685dce2ce102b8a1af47e7a3ddffb80","sha256:70a20611b97adc4e07490d8bc0e35f16355516eb05d83245c479f88ccf8a7439"],"state_sha256":"bd123430defe1762739f03b222ee3443f3dd1bb851371e217a8cfc346e7ce3b3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YE3UpCaGkpfVOrFa16JT7FI0vgJrqXO2K4xOsNWC3wP1UYTiPjImN2WiDUkanQxWVkqtcYnOgqAi/rCllBzgAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-02T18:22:36.832071Z","bundle_sha256":"02a5eff91e24450f464963dc7a1194e61c50538e2a5685697197d096a5e41d84"}}