{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:QYGACBGOKXFUVT5FRIIY4KNREW","short_pith_number":"pith:QYGACBGO","canonical_record":{"source":{"id":"2605.15319","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-14T18:33:49Z","cross_cats_sorted":[],"title_canon_sha256":"a1a94257b22037e75709837bf25223735779549cabc68c496550cc1269834dce","abstract_canon_sha256":"71512266042ef09d011b6b4be65779b72906b70a43fb78f10c1cda5ae3f8af1a"},"schema_version":"1.0"},"canonical_sha256":"860c0104ce55cb4acfa58a118e29b1258976298fb5cc20bd6676b462bea2d837","source":{"kind":"arxiv","id":"2605.15319","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.15319","created_at":"2026-05-20T00:00:52Z"},{"alias_kind":"arxiv_version","alias_value":"2605.15319v1","created_at":"2026-05-20T00:00:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.15319","created_at":"2026-05-20T00:00:52Z"},{"alias_kind":"pith_short_12","alias_value":"QYGACBGOKXFU","created_at":"2026-05-20T00:00:52Z"},{"alias_kind":"pith_short_16","alias_value":"QYGACBGOKXFUVT5F","created_at":"2026-05-20T00:00:52Z"},{"alias_kind":"pith_short_8","alias_value":"QYGACBGO","created_at":"2026-05-20T00:00:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:QYGACBGOKXFUVT5FRIIY4KNREW","target":"record","payload":{"canonical_record":{"source":{"id":"2605.15319","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-14T18:33:49Z","cross_cats_sorted":[],"title_canon_sha256":"a1a94257b22037e75709837bf25223735779549cabc68c496550cc1269834dce","abstract_canon_sha256":"71512266042ef09d011b6b4be65779b72906b70a43fb78f10c1cda5ae3f8af1a"},"schema_version":"1.0"},"canonical_sha256":"860c0104ce55cb4acfa58a118e29b1258976298fb5cc20bd6676b462bea2d837","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:00:52.420714Z","signature_b64":"iWA00zFui3cOIinVovID8hVVdCnSGkYNHfUYuYcvKrJyPb4yyLSOQNCGsyXYLfaPo+UqVsAOtDw16K6YRKcsCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"860c0104ce55cb4acfa58a118e29b1258976298fb5cc20bd6676b462bea2d837","last_reissued_at":"2026-05-20T00:00:52.419893Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:00:52.419893Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.15319","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-20T00:00:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6Nh1x4R19bkgihpWcS658IIPuwK6+UcjbIGXTJE433o74gpkP92nOZ8uNf+V8QQiwu40kaAx1cL9qA98slkHBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T06:53:56.660661Z"},"content_sha256":"5006e0392e83ba17ebb6c5147f41d9f7330969e5c62e36b3f6040cfdafa7962b","schema_version":"1.0","event_id":"sha256:5006e0392e83ba17ebb6c5147f41d9f7330969e5c62e36b3f6040cfdafa7962b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:QYGACBGOKXFUVT5FRIIY4KNREW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Extended Abstract: Canonical join complex and cubical coordinates for all framing lattices","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"Bricks and brick cliques give a uniform combinatorial model for canonical join representations in every framing lattice.","cross_cats":[],"primary_cat":"math.CO","authors_text":"Cl\\'ement Chenevi\\`ere, Jonah Berggren","submitted_at":"2026-05-14T18:33:49Z","abstract_excerpt":"This document is an extended abstract for two articles in preparation.\n  Recently, framing lattices were introduced to generalize many classical lattices such as the Tamari lattice and the weak order on the symmetric group. We define bricks and brick cliques as a combinatorial model for join-irreducible elements and canonical join representations in all framing lattices, generalizing noncrossing arc diagrams of (Reading, 2015) for the weak order on the symmetric group. Our model captures the natural bijection between join and meet canonical representations, as well as duality upon reflections "},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We define bricks and brick cliques as a combinatorial model for join-irreducible elements and canonical join representations in all framing lattices, generalizing noncrossing arc diagrams, with a bijective proof and explicit reconstruction algorithm in two steps that also captures the natural bijection between join and meet representations and duality upon reflections.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That the newly defined bricks and brick cliques correctly capture the join-irreducible elements and canonical join representations for every framing lattice, including those not previously studied with arc diagrams, so that the claimed bijective reconstruction works uniformly without additional restrictions on the framed graph.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Defines bricks, brick cliques, and cubical coordinates for framing lattices with a bijective proof generalizing prior models for Tamari and weak orders.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Bricks and brick cliques give a uniform combinatorial model for canonical join representations in every framing lattice.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"ed7f3af6e500662ac60baf09fc41d7f1568d58e5d25d5c6c74465e1a19dc111a"},"source":{"id":"2605.15319","kind":"arxiv","version":1},"verdict":{"id":"59f4a5f9-0805-482d-9d50-0447d321ed60","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T15:57:04.104525Z","strongest_claim":"We define bricks and brick cliques as a combinatorial model for join-irreducible elements and canonical join representations in all framing lattices, generalizing noncrossing arc diagrams, with a bijective proof and explicit reconstruction algorithm in two steps that also captures the natural bijection between join and meet representations and duality upon reflections.","one_line_summary":"Defines bricks, brick cliques, and cubical coordinates for framing lattices with a bijective proof generalizing prior models for Tamari and weak orders.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That the newly defined bricks and brick cliques correctly capture the join-irreducible elements and canonical join representations for every framing lattice, including those not previously studied with arc diagrams, so that the claimed bijective reconstruction works uniformly without additional restrictions on the framed graph.","pith_extraction_headline":"Bricks and brick cliques give a uniform combinatorial model for canonical join representations in every framing lattice."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.15319/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"doi_compliance","ran_at":"2026-05-19T16:04:55.075606Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_title_agreement","ran_at":"2026-05-19T16:01:18.152991Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T14:41:54.208483Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T13:33:22.768806Z","status":"skipped","version":"1.0.0","findings_count":0}],"snapshot_sha256":"0c10ef7f7f03200dcc87f6de7ad02e3ae216e70f82c5e25e0b94a8586b0601da"},"references":{"count":6,"sample":[{"doi":"","year":2023,"title":"The canonical complex of the weak order","work_id":"b5839520-9471-4867-90dc-9e3fcf0579ff","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2024,"title":"Framing lattices and flow poly- topes","work_id":"0de816d4-1b5d-46a5-a615-a96105dc0e9a","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2023,"title":"A unifying framework for the ν-Tamari lattice and principal order ideals in Young’s lattice","work_id":"f3887741-1972-4fd0-8305-d02078ae64d1","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2008,"title":"Kostant partitions functions and flow polytopes","work_id":"1999303e-20ab-48ec-b79d-68e42c849b80","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2016,"title":"Toric matrix Schubert varieties and their polytopes","work_id":"81743d23-d297-49ee-af72-6ead49d5f45a","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":6,"snapshot_sha256":"964c854e15fb513bb606161c193640623a2b004c3dc739743c517841941c5fa5","internal_anchors":0},"formal_canon":{"evidence_count":2,"snapshot_sha256":"e8b4c6c1c3043c730ffcc87a6b66e7ca2548f3599251d360ebed392f25920066"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"59f4a5f9-0805-482d-9d50-0447d321ed60"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-20T00:00:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sOC2DmItzpzSgvMk79Lfcewq8hKG+nU5kHi1J4Ij/WZvJoiNwNak2TO+tikkUN4gtcLmu88bo5wzMXc3EXyrBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T06:53:56.661387Z"},"content_sha256":"a7374a059166d1d0fad0d7ee5cf5e0c8dc28576bc0c596242e5dcbbfbc2838bd","schema_version":"1.0","event_id":"sha256:a7374a059166d1d0fad0d7ee5cf5e0c8dc28576bc0c596242e5dcbbfbc2838bd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QYGACBGOKXFUVT5FRIIY4KNREW/bundle.json","state_url":"https://pith.science/pith/QYGACBGOKXFUVT5FRIIY4KNREW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QYGACBGOKXFUVT5FRIIY4KNREW/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-25T06:53:56Z","links":{"resolver":"https://pith.science/pith/QYGACBGOKXFUVT5FRIIY4KNREW","bundle":"https://pith.science/pith/QYGACBGOKXFUVT5FRIIY4KNREW/bundle.json","state":"https://pith.science/pith/QYGACBGOKXFUVT5FRIIY4KNREW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QYGACBGOKXFUVT5FRIIY4KNREW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:QYGACBGOKXFUVT5FRIIY4KNREW","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":"71512266042ef09d011b6b4be65779b72906b70a43fb78f10c1cda5ae3f8af1a","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-14T18:33:49Z","title_canon_sha256":"a1a94257b22037e75709837bf25223735779549cabc68c496550cc1269834dce"},"schema_version":"1.0","source":{"id":"2605.15319","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.15319","created_at":"2026-05-20T00:00:52Z"},{"alias_kind":"arxiv_version","alias_value":"2605.15319v1","created_at":"2026-05-20T00:00:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.15319","created_at":"2026-05-20T00:00:52Z"},{"alias_kind":"pith_short_12","alias_value":"QYGACBGOKXFU","created_at":"2026-05-20T00:00:52Z"},{"alias_kind":"pith_short_16","alias_value":"QYGACBGOKXFUVT5F","created_at":"2026-05-20T00:00:52Z"},{"alias_kind":"pith_short_8","alias_value":"QYGACBGO","created_at":"2026-05-20T00:00:52Z"}],"graph_snapshots":[{"event_id":"sha256:a7374a059166d1d0fad0d7ee5cf5e0c8dc28576bc0c596242e5dcbbfbc2838bd","target":"graph","created_at":"2026-05-20T00:00:52Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"We define bricks and brick cliques as a combinatorial model for join-irreducible elements and canonical join representations in all framing lattices, generalizing noncrossing arc diagrams, with a bijective proof and explicit reconstruction algorithm in two steps that also captures the natural bijection between join and meet representations and duality upon reflections."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That the newly defined bricks and brick cliques correctly capture the join-irreducible elements and canonical join representations for every framing lattice, including those not previously studied with arc diagrams, so that the claimed bijective reconstruction works uniformly without additional restrictions on the framed graph."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Defines bricks, brick cliques, and cubical coordinates for framing lattices with a bijective proof generalizing prior models for Tamari and weak orders."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Bricks and brick cliques give a uniform combinatorial model for canonical join representations in every framing lattice."}],"snapshot_sha256":"ed7f3af6e500662ac60baf09fc41d7f1568d58e5d25d5c6c74465e1a19dc111a"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"e8b4c6c1c3043c730ffcc87a6b66e7ca2548f3599251d360ebed392f25920066"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T16:04:55.075606Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T16:01:18.152991Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-19T14:41:54.208483Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T13:33:22.768806Z","status":"skipped","version":"1.0.0"}],"endpoint":"/pith/2605.15319/integrity.json","findings":[],"snapshot_sha256":"0c10ef7f7f03200dcc87f6de7ad02e3ae216e70f82c5e25e0b94a8586b0601da","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This document is an extended abstract for two articles in preparation.\n  Recently, framing lattices were introduced to generalize many classical lattices such as the Tamari lattice and the weak order on the symmetric group. We define bricks and brick cliques as a combinatorial model for join-irreducible elements and canonical join representations in all framing lattices, generalizing noncrossing arc diagrams of (Reading, 2015) for the weak order on the symmetric group. Our model captures the natural bijection between join and meet canonical representations, as well as duality upon reflections ","authors_text":"Cl\\'ement Chenevi\\`ere, Jonah Berggren","cross_cats":[],"headline":"Bricks and brick cliques give a uniform combinatorial model for canonical join representations in every framing lattice.","license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-14T18:33:49Z","title":"Extended Abstract: Canonical join complex and cubical coordinates for all framing lattices"},"references":{"count":6,"internal_anchors":0,"resolved_work":6,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"The canonical complex of the weak order","work_id":"b5839520-9471-4867-90dc-9e3fcf0579ff","year":2023},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Framing lattices and flow poly- topes","work_id":"0de816d4-1b5d-46a5-a615-a96105dc0e9a","year":2024},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"A unifying framework for the ν-Tamari lattice and principal order ideals in Young’s lattice","work_id":"f3887741-1972-4fd0-8305-d02078ae64d1","year":2023},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Kostant partitions functions and flow polytopes","work_id":"1999303e-20ab-48ec-b79d-68e42c849b80","year":2008},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Toric matrix Schubert varieties and their polytopes","work_id":"81743d23-d297-49ee-af72-6ead49d5f45a","year":2016}],"snapshot_sha256":"964c854e15fb513bb606161c193640623a2b004c3dc739743c517841941c5fa5"},"source":{"id":"2605.15319","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-19T15:57:04.104525Z","id":"59f4a5f9-0805-482d-9d50-0447d321ed60","model_set":{"reader":"grok-4.3"},"one_line_summary":"Defines bricks, brick cliques, and cubical coordinates for framing lattices with a bijective proof generalizing prior models for Tamari and weak orders.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Bricks and brick cliques give a uniform combinatorial model for canonical join representations in every framing lattice.","strongest_claim":"We define bricks and brick cliques as a combinatorial model for join-irreducible elements and canonical join representations in all framing lattices, generalizing noncrossing arc diagrams, with a bijective proof and explicit reconstruction algorithm in two steps that also captures the natural bijection between join and meet representations and duality upon reflections.","weakest_assumption":"That the newly defined bricks and brick cliques correctly capture the join-irreducible elements and canonical join representations for every framing lattice, including those not previously studied with arc diagrams, so that the claimed bijective reconstruction works uniformly without additional restrictions on the framed graph."}},"verdict_id":"59f4a5f9-0805-482d-9d50-0447d321ed60"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:5006e0392e83ba17ebb6c5147f41d9f7330969e5c62e36b3f6040cfdafa7962b","target":"record","created_at":"2026-05-20T00:00:52Z","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":"71512266042ef09d011b6b4be65779b72906b70a43fb78f10c1cda5ae3f8af1a","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-14T18:33:49Z","title_canon_sha256":"a1a94257b22037e75709837bf25223735779549cabc68c496550cc1269834dce"},"schema_version":"1.0","source":{"id":"2605.15319","kind":"arxiv","version":1}},"canonical_sha256":"860c0104ce55cb4acfa58a118e29b1258976298fb5cc20bd6676b462bea2d837","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"860c0104ce55cb4acfa58a118e29b1258976298fb5cc20bd6676b462bea2d837","first_computed_at":"2026-05-20T00:00:52.419893Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:00:52.419893Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iWA00zFui3cOIinVovID8hVVdCnSGkYNHfUYuYcvKrJyPb4yyLSOQNCGsyXYLfaPo+UqVsAOtDw16K6YRKcsCw==","signature_status":"signed_v1","signed_at":"2026-05-20T00:00:52.420714Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.15319","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5006e0392e83ba17ebb6c5147f41d9f7330969e5c62e36b3f6040cfdafa7962b","sha256:a7374a059166d1d0fad0d7ee5cf5e0c8dc28576bc0c596242e5dcbbfbc2838bd"],"state_sha256":"fa91ec4c48878b7e48bf30dbfdd1f99a7b8db0ff78173e424d4e29911d97749e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gyRSpGTaqT98c159lWKz+x+AYPHYphtQQ2RnvKwS6E0acZZL4pYCMiK1vH0r59cYwZQwcDwuqRLysl35zRdJAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T06:53:56.664217Z","bundle_sha256":"d504e9acf1381f021b23241cc759b8bd4344d3304e02147435ea34c82730e001"}}