{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:3WNXVID56LOACYUVBUMZ2URNSW","short_pith_number":"pith:3WNXVID5","canonical_record":{"source":{"id":"2108.07890","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2021-08-17T21:43:55Z","cross_cats_sorted":[],"title_canon_sha256":"b6e42e0828964a3320aa1085335c599094961aa8e2cff6cf08289653f98f4b04","abstract_canon_sha256":"8be95e0bd39a5d2c93dea761468154e81977936e5788ffdc62bf214e1885098e"},"schema_version":"1.0"},"canonical_sha256":"dd9b7aa07df2dc0162950d199d522d95a6a008ed7bb80aac5a4dace87a0885a7","source":{"kind":"arxiv","id":"2108.07890","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2108.07890","created_at":"2026-07-05T03:07:31Z"},{"alias_kind":"arxiv_version","alias_value":"2108.07890v2","created_at":"2026-07-05T03:07:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2108.07890","created_at":"2026-07-05T03:07:31Z"},{"alias_kind":"pith_short_12","alias_value":"3WNXVID56LOA","created_at":"2026-07-05T03:07:31Z"},{"alias_kind":"pith_short_16","alias_value":"3WNXVID56LOACYUV","created_at":"2026-07-05T03:07:31Z"},{"alias_kind":"pith_short_8","alias_value":"3WNXVID5","created_at":"2026-07-05T03:07:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:3WNXVID56LOACYUVBUMZ2URNSW","target":"record","payload":{"canonical_record":{"source":{"id":"2108.07890","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2021-08-17T21:43:55Z","cross_cats_sorted":[],"title_canon_sha256":"b6e42e0828964a3320aa1085335c599094961aa8e2cff6cf08289653f98f4b04","abstract_canon_sha256":"8be95e0bd39a5d2c93dea761468154e81977936e5788ffdc62bf214e1885098e"},"schema_version":"1.0"},"canonical_sha256":"dd9b7aa07df2dc0162950d199d522d95a6a008ed7bb80aac5a4dace87a0885a7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:07:31.229753Z","signature_b64":"j41PTyB2fxiSV0fWdijjMzEkwn2mQaxacOMU+rqczuJOVkOUOn1VaofE1u8LR1PLOCpVcCKnpFcdcZOXiCNpAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dd9b7aa07df2dc0162950d199d522d95a6a008ed7bb80aac5a4dace87a0885a7","last_reissued_at":"2026-07-05T03:07:31.229344Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:07:31.229344Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2108.07890","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-07-05T03:07:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Iz2to4CwjB5HDd+NBvC/90q6twpLTBPBiJmN0ElQLXYpzCYC3Heo4RTDDiPnUXsVD1cpHJWM6aFIoKRb1J8ZBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T05:31:28.758225Z"},"content_sha256":"827fb530b6b6eca7df28cb04aa63ba5657a815341808dff11b31821f90ca57f3","schema_version":"1.0","event_id":"sha256:827fb530b6b6eca7df28cb04aa63ba5657a815341808dff11b31821f90ca57f3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:3WNXVID56LOACYUVBUMZ2URNSW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Constructing Triangle Decomposable Multigraphs with Minimum Multi-edges","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"A. K. Wright, C. M. Mynhardt","submitted_at":"2021-08-17T21:43:55Z","abstract_excerpt":"We study triangle decompositions of graphs. We consider constructions of classes of graphs where every edge lies on a triangle and the addition of the minimum number of multiple edges between already adjacent vertices results in a strongly triangle divisible graph that is also triangle decomposable. We explore several classes of planar graphs as well as a class of toroidal graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2108.07890","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/2108.07890/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-07-05T03:07:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hnZsJeFKSBKZKxeyC8KJl1J3pgumfElEyzaMv9qvxxWaZ/x5qEz2DBcLAjmF1XPgA6fMyHE21FS3yE9gzIQcCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T05:31:28.758728Z"},"content_sha256":"516d754aec9b269322d5ce4ed0f7096eb85f170ccc3875554563e4d814dba4fe","schema_version":"1.0","event_id":"sha256:516d754aec9b269322d5ce4ed0f7096eb85f170ccc3875554563e4d814dba4fe"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3WNXVID56LOACYUVBUMZ2URNSW/bundle.json","state_url":"https://pith.science/pith/3WNXVID56LOACYUVBUMZ2URNSW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3WNXVID56LOACYUVBUMZ2URNSW/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-08-20T05:31:28Z","links":{"resolver":"https://pith.science/pith/3WNXVID56LOACYUVBUMZ2URNSW","bundle":"https://pith.science/pith/3WNXVID56LOACYUVBUMZ2URNSW/bundle.json","state":"https://pith.science/pith/3WNXVID56LOACYUVBUMZ2URNSW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3WNXVID56LOACYUVBUMZ2URNSW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:3WNXVID56LOACYUVBUMZ2URNSW","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":"8be95e0bd39a5d2c93dea761468154e81977936e5788ffdc62bf214e1885098e","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2021-08-17T21:43:55Z","title_canon_sha256":"b6e42e0828964a3320aa1085335c599094961aa8e2cff6cf08289653f98f4b04"},"schema_version":"1.0","source":{"id":"2108.07890","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2108.07890","created_at":"2026-07-05T03:07:31Z"},{"alias_kind":"arxiv_version","alias_value":"2108.07890v2","created_at":"2026-07-05T03:07:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2108.07890","created_at":"2026-07-05T03:07:31Z"},{"alias_kind":"pith_short_12","alias_value":"3WNXVID56LOA","created_at":"2026-07-05T03:07:31Z"},{"alias_kind":"pith_short_16","alias_value":"3WNXVID56LOACYUV","created_at":"2026-07-05T03:07:31Z"},{"alias_kind":"pith_short_8","alias_value":"3WNXVID5","created_at":"2026-07-05T03:07:31Z"}],"graph_snapshots":[{"event_id":"sha256:516d754aec9b269322d5ce4ed0f7096eb85f170ccc3875554563e4d814dba4fe","target":"graph","created_at":"2026-07-05T03:07:31Z","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/2108.07890/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study triangle decompositions of graphs. We consider constructions of classes of graphs where every edge lies on a triangle and the addition of the minimum number of multiple edges between already adjacent vertices results in a strongly triangle divisible graph that is also triangle decomposable. We explore several classes of planar graphs as well as a class of toroidal graphs.","authors_text":"A. K. Wright, C. M. Mynhardt","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2021-08-17T21:43:55Z","title":"Constructing Triangle Decomposable Multigraphs with Minimum Multi-edges"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2108.07890","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:827fb530b6b6eca7df28cb04aa63ba5657a815341808dff11b31821f90ca57f3","target":"record","created_at":"2026-07-05T03:07:31Z","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":"8be95e0bd39a5d2c93dea761468154e81977936e5788ffdc62bf214e1885098e","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2021-08-17T21:43:55Z","title_canon_sha256":"b6e42e0828964a3320aa1085335c599094961aa8e2cff6cf08289653f98f4b04"},"schema_version":"1.0","source":{"id":"2108.07890","kind":"arxiv","version":2}},"canonical_sha256":"dd9b7aa07df2dc0162950d199d522d95a6a008ed7bb80aac5a4dace87a0885a7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dd9b7aa07df2dc0162950d199d522d95a6a008ed7bb80aac5a4dace87a0885a7","first_computed_at":"2026-07-05T03:07:31.229344Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:07:31.229344Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"j41PTyB2fxiSV0fWdijjMzEkwn2mQaxacOMU+rqczuJOVkOUOn1VaofE1u8LR1PLOCpVcCKnpFcdcZOXiCNpAA==","signature_status":"signed_v1","signed_at":"2026-07-05T03:07:31.229753Z","signed_message":"canonical_sha256_bytes"},"source_id":"2108.07890","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:827fb530b6b6eca7df28cb04aa63ba5657a815341808dff11b31821f90ca57f3","sha256:516d754aec9b269322d5ce4ed0f7096eb85f170ccc3875554563e4d814dba4fe"],"state_sha256":"98e8a54ac0d3a6e44fa568abec9a29c968a00f2194fb4e6c9933badb25b67b4e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MgZ5E/1Ljv4KhQLFdOSkncMp9iMWHeW7qMmUyOpfTOlngijdjER2psEf57SAceHv16QjbIdWCVVbs9DRDy09AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-20T05:31:28.763668Z","bundle_sha256":"972c62a78b4d9ba3e8ad8a69e1c0488ecdd4414b036a5e5ce0f43376b6603e05"}}