{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:76GJIRJ5VWMYVCZ26H75M3WACK","short_pith_number":"pith:76GJIRJ5","canonical_record":{"source":{"id":"1612.06609","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-12-20T11:10:42Z","cross_cats_sorted":["math.GR"],"title_canon_sha256":"79617615b50951f352e4112e7403879816130b362cde85c4bb828a25cde0abd7","abstract_canon_sha256":"29c0627ec419abeb11cc525afabdda49b416a4f651167040ca2f235566753a31"},"schema_version":"1.0"},"canonical_sha256":"ff8c94453dad998a8b3af1ffd66ec012a3ac8d5094b8b094101d7d2b4e7e5771","source":{"kind":"arxiv","id":"1612.06609","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.06609","created_at":"2026-05-18T00:54:25Z"},{"alias_kind":"arxiv_version","alias_value":"1612.06609v1","created_at":"2026-05-18T00:54:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.06609","created_at":"2026-05-18T00:54:25Z"},{"alias_kind":"pith_short_12","alias_value":"76GJIRJ5VWMY","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"76GJIRJ5VWMYVCZ2","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"76GJIRJ5","created_at":"2026-05-18T12:30:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:76GJIRJ5VWMYVCZ26H75M3WACK","target":"record","payload":{"canonical_record":{"source":{"id":"1612.06609","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-12-20T11:10:42Z","cross_cats_sorted":["math.GR"],"title_canon_sha256":"79617615b50951f352e4112e7403879816130b362cde85c4bb828a25cde0abd7","abstract_canon_sha256":"29c0627ec419abeb11cc525afabdda49b416a4f651167040ca2f235566753a31"},"schema_version":"1.0"},"canonical_sha256":"ff8c94453dad998a8b3af1ffd66ec012a3ac8d5094b8b094101d7d2b4e7e5771","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:54:25.239180Z","signature_b64":"Dj3mrP3hDgHpV0V9mwhS0uqrd80XJ+hmrP3EPDUMarI8lV12G3kodjfwvl6aD9yXjHFgWqW7iCz5eAFqk7UBDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ff8c94453dad998a8b3af1ffd66ec012a3ac8d5094b8b094101d7d2b4e7e5771","last_reissued_at":"2026-05-18T00:54:25.238553Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:54:25.238553Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1612.06609","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:54:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6uRXEfiXE7mygUW2yY87svCOGe+rzEcom8CCO9GsH/W+gypW+x+k4DKCa7muq3bzirQ+Ebic8KDc9y8aDCAQDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T09:08:29.521043Z"},"content_sha256":"7998b563ea6642f09f5cdf2d9226781c4a7d741306a2c93c21a49d2e3c263cb9","schema_version":"1.0","event_id":"sha256:7998b563ea6642f09f5cdf2d9226781c4a7d741306a2c93c21a49d2e3c263cb9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:76GJIRJ5VWMYVCZ26H75M3WACK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Generalised Paley graphs with a product structure","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.GR"],"primary_cat":"math.CO","authors_text":"Cheryl E Praeger, Geoffrey Pearce","submitted_at":"2016-12-20T11:10:42Z","abstract_excerpt":"A graph is Cartesian decomposable if it is isomorphic to a Cartesian product of (more than one) strictly smaller graphs, each of which has more than one vertex and admits no such decomposition. These smaller graphs are called the Cartesian-prime factors of the Cartesian decomposition, and were shown, by Sabidussi and Vizing independently, to be uniquely determined up to isomorphism. We characterise by their parameters those generalised Paley graphs which are Cartesian decomposable, and we prove that for such graphs, the Cartesian-prime factors are themselves smaller generalised Paley graphs. T"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.06609","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:54:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Jik3NPbFM1fUuHEw8H+EzmZXHM4NcM0S7oC9Cv7HVwtrW0Y5UvLfoipaC7P5vT1MhQGPRRP4lIoeOUWnr3a/DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T09:08:29.521402Z"},"content_sha256":"e0bcceba175cebdb6afebb715db5d90f734b8cde4ba5cd335a438ddbb132d9b4","schema_version":"1.0","event_id":"sha256:e0bcceba175cebdb6afebb715db5d90f734b8cde4ba5cd335a438ddbb132d9b4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/76GJIRJ5VWMYVCZ26H75M3WACK/bundle.json","state_url":"https://pith.science/pith/76GJIRJ5VWMYVCZ26H75M3WACK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/76GJIRJ5VWMYVCZ26H75M3WACK/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-06T09:08:29Z","links":{"resolver":"https://pith.science/pith/76GJIRJ5VWMYVCZ26H75M3WACK","bundle":"https://pith.science/pith/76GJIRJ5VWMYVCZ26H75M3WACK/bundle.json","state":"https://pith.science/pith/76GJIRJ5VWMYVCZ26H75M3WACK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/76GJIRJ5VWMYVCZ26H75M3WACK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:76GJIRJ5VWMYVCZ26H75M3WACK","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":"29c0627ec419abeb11cc525afabdda49b416a4f651167040ca2f235566753a31","cross_cats_sorted":["math.GR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-12-20T11:10:42Z","title_canon_sha256":"79617615b50951f352e4112e7403879816130b362cde85c4bb828a25cde0abd7"},"schema_version":"1.0","source":{"id":"1612.06609","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.06609","created_at":"2026-05-18T00:54:25Z"},{"alias_kind":"arxiv_version","alias_value":"1612.06609v1","created_at":"2026-05-18T00:54:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.06609","created_at":"2026-05-18T00:54:25Z"},{"alias_kind":"pith_short_12","alias_value":"76GJIRJ5VWMY","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"76GJIRJ5VWMYVCZ2","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"76GJIRJ5","created_at":"2026-05-18T12:30:04Z"}],"graph_snapshots":[{"event_id":"sha256:e0bcceba175cebdb6afebb715db5d90f734b8cde4ba5cd335a438ddbb132d9b4","target":"graph","created_at":"2026-05-18T00:54:25Z","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 is Cartesian decomposable if it is isomorphic to a Cartesian product of (more than one) strictly smaller graphs, each of which has more than one vertex and admits no such decomposition. These smaller graphs are called the Cartesian-prime factors of the Cartesian decomposition, and were shown, by Sabidussi and Vizing independently, to be uniquely determined up to isomorphism. We characterise by their parameters those generalised Paley graphs which are Cartesian decomposable, and we prove that for such graphs, the Cartesian-prime factors are themselves smaller generalised Paley graphs. T","authors_text":"Cheryl E Praeger, Geoffrey Pearce","cross_cats":["math.GR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-12-20T11:10:42Z","title":"Generalised Paley graphs with a product structure"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.06609","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:7998b563ea6642f09f5cdf2d9226781c4a7d741306a2c93c21a49d2e3c263cb9","target":"record","created_at":"2026-05-18T00:54:25Z","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":"29c0627ec419abeb11cc525afabdda49b416a4f651167040ca2f235566753a31","cross_cats_sorted":["math.GR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-12-20T11:10:42Z","title_canon_sha256":"79617615b50951f352e4112e7403879816130b362cde85c4bb828a25cde0abd7"},"schema_version":"1.0","source":{"id":"1612.06609","kind":"arxiv","version":1}},"canonical_sha256":"ff8c94453dad998a8b3af1ffd66ec012a3ac8d5094b8b094101d7d2b4e7e5771","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ff8c94453dad998a8b3af1ffd66ec012a3ac8d5094b8b094101d7d2b4e7e5771","first_computed_at":"2026-05-18T00:54:25.238553Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:54:25.238553Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Dj3mrP3hDgHpV0V9mwhS0uqrd80XJ+hmrP3EPDUMarI8lV12G3kodjfwvl6aD9yXjHFgWqW7iCz5eAFqk7UBDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:54:25.239180Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.06609","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7998b563ea6642f09f5cdf2d9226781c4a7d741306a2c93c21a49d2e3c263cb9","sha256:e0bcceba175cebdb6afebb715db5d90f734b8cde4ba5cd335a438ddbb132d9b4"],"state_sha256":"e1b4ba5643d640224d4824fb7a4eed78e36178c540f6773f0726f97f3ed91532"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vQefuDlUafSYTPoo4/gzKhUpDBG/Mt1lAC1beSHpwcZnCFNiVgzcls8DH8cvmNKNhSFRAS2jBOJpacOcvy5DAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T09:08:29.523417Z","bundle_sha256":"f92460235a042be78f7f1a7eb7ec575e9be1efd2f4464b22e2fac85b17f11d87"}}