{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:ZDUW75O7VYNYP25NDUF7XOANPS","short_pith_number":"pith:ZDUW75O7","schema_version":"1.0","canonical_sha256":"c8e96ff5dfae1b87ebad1d0bfbb80d7c8746219554d6722ee6abbb11f5b65940","source":{"kind":"arxiv","id":"2308.07684","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2308.07684","created_at":"2026-05-26T01:03:07.708471+00:00"},{"alias_kind":"arxiv_version","alias_value":"2308.07684v2","created_at":"2026-05-26T01:03:07.708471+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.07684","created_at":"2026-05-26T01:03:07.708471+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZDUW75O7VYNY","created_at":"2026-05-26T01:03:07.708471+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZDUW75O7VYNYP25N","created_at":"2026-05-26T01:03:07.708471+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZDUW75O7","created_at":"2026-05-26T01:03:07.708471+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/ZDUW75O7VYNYP25NDUF7XOANPS","json":"https://pith.science/pith/ZDUW75O7VYNYP25NDUF7XOANPS.json","graph_json":"https://pith.science/api/pith-number/ZDUW75O7VYNYP25NDUF7XOANPS/graph.json","events_json":"https://pith.science/api/pith-number/ZDUW75O7VYNYP25NDUF7XOANPS/events.json","paper":"https://pith.science/paper/ZDUW75O7"},"agent_actions":{"view_html":"https://pith.science/pith/ZDUW75O7VYNYP25NDUF7XOANPS","download_json":"https://pith.science/pith/ZDUW75O7VYNYP25NDUF7XOANPS.json","view_paper":"https://pith.science/paper/ZDUW75O7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2308.07684&json=true","fetch_graph":"https://pith.science/api/pith-number/ZDUW75O7VYNYP25NDUF7XOANPS/graph.json","fetch_events":"https://pith.science/api/pith-number/ZDUW75O7VYNYP25NDUF7XOANPS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZDUW75O7VYNYP25NDUF7XOANPS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZDUW75O7VYNYP25NDUF7XOANPS/action/storage_attestation","attest_author":"https://pith.science/pith/ZDUW75O7VYNYP25NDUF7XOANPS/action/author_attestation","sign_citation":"https://pith.science/pith/ZDUW75O7VYNYP25NDUF7XOANPS/action/citation_signature","submit_replication":"https://pith.science/pith/ZDUW75O7VYNYP25NDUF7XOANPS/action/replication_record"}},"created_at":"2026-05-26T01:03:07.708471+00:00","updated_at":"2026-05-26T01:03:07.708471+00:00"}