{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:ZDUW75O7VYNYP25NDUF7XOANPS","short_pith_number":"pith:ZDUW75O7","canonical_record":{"source":{"id":"2308.07684","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2023-08-15T10:29:06Z","cross_cats_sorted":["math.GR"],"title_canon_sha256":"421d9c0587d10f980a4986e090021acbae0516777a2115f7ac40bc63362379a6","abstract_canon_sha256":"e6242c916abb6edcaad86dcdcfb8ec99ff181cb2a7ead429ece4cb558977f4ac"},"schema_version":"1.0"},"canonical_sha256":"c8e96ff5dfae1b87ebad1d0bfbb80d7c8746219554d6722ee6abbb11f5b65940","source":{"kind":"arxiv","id":"2308.07684","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2308.07684","created_at":"2026-05-26T01:03:07Z"},{"alias_kind":"arxiv_version","alias_value":"2308.07684v2","created_at":"2026-05-26T01:03:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.07684","created_at":"2026-05-26T01:03:07Z"},{"alias_kind":"pith_short_12","alias_value":"ZDUW75O7VYNY","created_at":"2026-05-26T01:03:07Z"},{"alias_kind":"pith_short_16","alias_value":"ZDUW75O7VYNYP25N","created_at":"2026-05-26T01:03:07Z"},{"alias_kind":"pith_short_8","alias_value":"ZDUW75O7","created_at":"2026-05-26T01:03:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:ZDUW75O7VYNYP25NDUF7XOANPS","target":"record","payload":{"canonical_record":{"source":{"id":"2308.07684","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2023-08-15T10:29:06Z","cross_cats_sorted":["math.GR"],"title_canon_sha256":"421d9c0587d10f980a4986e090021acbae0516777a2115f7ac40bc63362379a6","abstract_canon_sha256":"e6242c916abb6edcaad86dcdcfb8ec99ff181cb2a7ead429ece4cb558977f4ac"},"schema_version":"1.0"},"canonical_sha256":"c8e96ff5dfae1b87ebad1d0bfbb80d7c8746219554d6722ee6abbb11f5b65940","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-26T01:03:07.709099Z","signature_b64":"+pDCV6EL87jWCbym8LdpF0FxrUmvQvNZfR0m10XslJobBBJslZYck0L/Txk6uek2VpzGvgB+zmdMw/iMwxx/Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c8e96ff5dfae1b87ebad1d0bfbb80d7c8746219554d6722ee6abbb11f5b65940","last_reissued_at":"2026-05-26T01:03:07.708364Z","signature_status":"signed_v1","first_computed_at":"2026-05-26T01:03:07.708364Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2308.07684","source_version":2,"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-26T01:03:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Pbzmmsk8JUWwixCpnqWcXa8FBTL7Fbkh/uiaQ6yvs7NKL9LkEdWEM7/G4J/Q45r6P7FxRF4wq26j+O9VgsuUCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T14:00:49.120530Z"},"content_sha256":"abd3bf9fd46ec14ca28b722be2c294936ac6bbc6e633c9360b0c5c01debf88e0","schema_version":"1.0","event_id":"sha256:abd3bf9fd46ec14ca28b722be2c294936ac6bbc6e633c9360b0c5c01debf88e0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:ZDUW75O7VYNYP25NDUF7XOANPS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Transitive path decompositions of Cartesian products of complete graphs","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["math.GR"],"primary_cat":"math.CO","authors_text":"Ajani De Vas Gunasekara, Alice Devillers","submitted_at":"2023-08-15T10:29:06Z","abstract_excerpt":"An $H$-decomposition of a graph $\\Gamma$ is a partition of its edge set into subgraphs isomorphic to $H$. A transitive decomposition is a special kind of $H$-decomposition that is highly symmetrical in the sense that the subgraphs (copies of $H$) are preserved and transitively permuted by a group of automorphisms of $\\Gamma$. This paper concerns transitive $H$-decompositions of the graph $K_n \\Box K_n$ where $H$ is a path. When $n$ is an odd prime, we present a construction for a transitive path decomposition where the paths in the decomposition are considerably large compared to the number of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.07684","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2308.07684/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-26T01:03:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U5EUXsfJmIqQ8v6fhKbE16rdyXTiUi7LDJXAo7FWbA0XlXSGXETJP6YS5XyJClk/SH7DJnjtLMKP0oDuSAquDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T14:00:49.120913Z"},"content_sha256":"740961a028e33ccec569d53ae44f036d3856ec251daed064f53cbed0644ec3e1","schema_version":"1.0","event_id":"sha256:740961a028e33ccec569d53ae44f036d3856ec251daed064f53cbed0644ec3e1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZDUW75O7VYNYP25NDUF7XOANPS/bundle.json","state_url":"https://pith.science/pith/ZDUW75O7VYNYP25NDUF7XOANPS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZDUW75O7VYNYP25NDUF7XOANPS/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-25T14:00:49Z","links":{"resolver":"https://pith.science/pith/ZDUW75O7VYNYP25NDUF7XOANPS","bundle":"https://pith.science/pith/ZDUW75O7VYNYP25NDUF7XOANPS/bundle.json","state":"https://pith.science/pith/ZDUW75O7VYNYP25NDUF7XOANPS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZDUW75O7VYNYP25NDUF7XOANPS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:ZDUW75O7VYNYP25NDUF7XOANPS","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":"e6242c916abb6edcaad86dcdcfb8ec99ff181cb2a7ead429ece4cb558977f4ac","cross_cats_sorted":["math.GR"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2023-08-15T10:29:06Z","title_canon_sha256":"421d9c0587d10f980a4986e090021acbae0516777a2115f7ac40bc63362379a6"},"schema_version":"1.0","source":{"id":"2308.07684","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2308.07684","created_at":"2026-05-26T01:03:07Z"},{"alias_kind":"arxiv_version","alias_value":"2308.07684v2","created_at":"2026-05-26T01:03:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.07684","created_at":"2026-05-26T01:03:07Z"},{"alias_kind":"pith_short_12","alias_value":"ZDUW75O7VYNY","created_at":"2026-05-26T01:03:07Z"},{"alias_kind":"pith_short_16","alias_value":"ZDUW75O7VYNYP25N","created_at":"2026-05-26T01:03:07Z"},{"alias_kind":"pith_short_8","alias_value":"ZDUW75O7","created_at":"2026-05-26T01:03:07Z"}],"graph_snapshots":[{"event_id":"sha256:740961a028e33ccec569d53ae44f036d3856ec251daed064f53cbed0644ec3e1","target":"graph","created_at":"2026-05-26T01:03:07Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2308.07684/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"An $H$-decomposition of a graph $\\Gamma$ is a partition of its edge set into subgraphs isomorphic to $H$. A transitive decomposition is a special kind of $H$-decomposition that is highly symmetrical in the sense that the subgraphs (copies of $H$) are preserved and transitively permuted by a group of automorphisms of $\\Gamma$. This paper concerns transitive $H$-decompositions of the graph $K_n \\Box K_n$ where $H$ is a path. When $n$ is an odd prime, we present a construction for a transitive path decomposition where the paths in the decomposition are considerably large compared to the number of","authors_text":"Ajani De Vas Gunasekara, Alice Devillers","cross_cats":["math.GR"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2023-08-15T10:29:06Z","title":"Transitive path decompositions of Cartesian products of complete graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.07684","kind":"arxiv","version":2},"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:abd3bf9fd46ec14ca28b722be2c294936ac6bbc6e633c9360b0c5c01debf88e0","target":"record","created_at":"2026-05-26T01:03:07Z","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":"e6242c916abb6edcaad86dcdcfb8ec99ff181cb2a7ead429ece4cb558977f4ac","cross_cats_sorted":["math.GR"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2023-08-15T10:29:06Z","title_canon_sha256":"421d9c0587d10f980a4986e090021acbae0516777a2115f7ac40bc63362379a6"},"schema_version":"1.0","source":{"id":"2308.07684","kind":"arxiv","version":2}},"canonical_sha256":"c8e96ff5dfae1b87ebad1d0bfbb80d7c8746219554d6722ee6abbb11f5b65940","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c8e96ff5dfae1b87ebad1d0bfbb80d7c8746219554d6722ee6abbb11f5b65940","first_computed_at":"2026-05-26T01:03:07.708364Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-26T01:03:07.708364Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+pDCV6EL87jWCbym8LdpF0FxrUmvQvNZfR0m10XslJobBBJslZYck0L/Txk6uek2VpzGvgB+zmdMw/iMwxx/Bw==","signature_status":"signed_v1","signed_at":"2026-05-26T01:03:07.709099Z","signed_message":"canonical_sha256_bytes"},"source_id":"2308.07684","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:abd3bf9fd46ec14ca28b722be2c294936ac6bbc6e633c9360b0c5c01debf88e0","sha256:740961a028e33ccec569d53ae44f036d3856ec251daed064f53cbed0644ec3e1"],"state_sha256":"cd325ea824056e80caf57af366d7ab3c46a13fc406046a8e1a2409f9070f78b9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"elKNOXVBoku8cfnkJNluxL/ID9pHVHvcdQal5M1oWqIFbXmFz9/UYlhYh+f9zYgOM8gyAP3cGVAcGXe/DiOgBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T14:00:49.123153Z","bundle_sha256":"bd6fe80b343070872c2540cc500d51a140bb927c890f28843157aac1922262a9"}}