{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:OYFZNS7VIQLNIEEFSK3WOFNRXE","short_pith_number":"pith:OYFZNS7V","canonical_record":{"source":{"id":"2605.12822","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-12T23:44:53Z","cross_cats_sorted":[],"title_canon_sha256":"fce3a735b96973702fbd214aa60559cf751a51569c56ab413c75be4a3dd28b59","abstract_canon_sha256":"cd678e3bd56cb01645c53faa3c527f77b91f317a848ea799750d84dce552f2eb"},"schema_version":"1.0"},"canonical_sha256":"760b96cbf54416d4108592b76715b1b915806d27fb0ce81923073f67e5d05aac","source":{"kind":"arxiv","id":"2605.12822","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.12822","created_at":"2026-05-18T03:09:12Z"},{"alias_kind":"arxiv_version","alias_value":"2605.12822v1","created_at":"2026-05-18T03:09:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.12822","created_at":"2026-05-18T03:09:12Z"},{"alias_kind":"pith_short_12","alias_value":"OYFZNS7VIQLN","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"OYFZNS7VIQLNIEEF","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"OYFZNS7V","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:OYFZNS7VIQLNIEEFSK3WOFNRXE","target":"record","payload":{"canonical_record":{"source":{"id":"2605.12822","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-12T23:44:53Z","cross_cats_sorted":[],"title_canon_sha256":"fce3a735b96973702fbd214aa60559cf751a51569c56ab413c75be4a3dd28b59","abstract_canon_sha256":"cd678e3bd56cb01645c53faa3c527f77b91f317a848ea799750d84dce552f2eb"},"schema_version":"1.0"},"canonical_sha256":"760b96cbf54416d4108592b76715b1b915806d27fb0ce81923073f67e5d05aac","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:09:12.207201Z","signature_b64":"6fNhIQ/V+eFv6iNPAzaQ7+F5iaEICdOCfEHMcRqZeRkNPz69wcRS0sp9ksEcT8MxPB4x4ptxIXQ47UY92kPsAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"760b96cbf54416d4108592b76715b1b915806d27fb0ce81923073f67e5d05aac","last_reissued_at":"2026-05-18T03:09:12.206552Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:09:12.206552Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.12822","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-18T03:09:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SkC9qkie51Yo+YYlarXKWwUFFohbfuRy+BuSxzj9/a+uDlNhhXRoaeIr/KandwUvhp5aJrAnoWPOuSf+5MRDDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T23:55:34.279558Z"},"content_sha256":"2abf3fbc131983893af4db628234661589ba0b4af63686a31cb15d87ab3f10a8","schema_version":"1.0","event_id":"sha256:2abf3fbc131983893af4db628234661589ba0b4af63686a31cb15d87ab3f10a8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:OYFZNS7VIQLNIEEFSK3WOFNRXE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Unimodality of $q$-Fibonomial coefficients for small cases","license":"http://creativecommons.org/licenses/by/4.0/","headline":"q-Fibonomial coefficients are unimodal for all n at most 3","cross_cats":[],"primary_cat":"math.CO","authors_text":"Brendan B. Connelly, Ezekiel Ito, Kacey Yang, Olha Shevchenko, Thomas C. Martinez","submitted_at":"2026-05-12T23:44:53Z","abstract_excerpt":"Bergeron--Ceballos--K\\\"ustner introduced the $q$-Fibonomial coefficients \\( \\qfibonom{m+n}{n}\\), gave a combinatorial interpretation of the $q$-Fibonomial coefficients via a weighted path-domino tiling model, and conjectured that these polynomials are unimodal. We prove the conjecture for $n\\leq3$. For the $n=2$ case, we give a combinatorial proof of both unimodality and symmetry by defining a nearly symmetric saturated chain decomposition on the set of tilings. For all three cases, we give an algebraic proof. Finally, for the $n=3$ case, we establish a more general unimodality result for cert"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We prove the conjecture for n≤3. For the n=2 case, we give a combinatorial proof of both unimodality and symmetry by defining a nearly symmetric saturated chain decomposition on the set of tilings.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The weighted path-domino tiling model introduced by Bergeron--Ceballos--Küstner correctly interprets the q-Fibonomial coefficients and that the algebraic identities for q-analogs hold without additional restrictions for the small n considered.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"q-Fibonomial coefficients are unimodal for n≤3, with a combinatorial proof of unimodality and symmetry for n=2 via nearly symmetric saturated chain decompositions on tilings and algebraic proofs for n≤3.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"q-Fibonomial coefficients are unimodal for all n at most 3","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"1c49ebf161dba205ad0285783d1a171cb3d60d538f944edc324a5145a0b49521"},"source":{"id":"2605.12822","kind":"arxiv","version":1},"verdict":{"id":"8f5a7bb6-e5a9-4cb3-874a-2d1decad5049","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-14T19:21:27.682099Z","strongest_claim":"We prove the conjecture for n≤3. For the n=2 case, we give a combinatorial proof of both unimodality and symmetry by defining a nearly symmetric saturated chain decomposition on the set of tilings.","one_line_summary":"q-Fibonomial coefficients are unimodal for n≤3, with a combinatorial proof of unimodality and symmetry for n=2 via nearly symmetric saturated chain decompositions on tilings and algebraic proofs for n≤3.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The weighted path-domino tiling model introduced by Bergeron--Ceballos--Küstner correctly interprets the q-Fibonomial coefficients and that the algebraic identities for q-analogs hold without additional restrictions for the small n considered.","pith_extraction_headline":"q-Fibonomial coefficients are unimodal for all n at most 3"},"references":{"count":19,"sample":[{"doi":"","year":null,"title":"Symmetry, Integrability and Geometry: Methods and Applications , language =","work_id":"e6d816c8-66ed-49b6-835b-a2bb2b2f3052","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"Benjamin, Arthur and Quinn, Jennifer J. , address =","work_id":"fa8b6523-cb71-4836-88a7-cacad4c84768","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1989,"title":"1989 , publisher =","work_id":"cbe25d5b-6871-4096-81ac-d3dc98561d85","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"1878 , publisher =","work_id":"8d0cca3b-9dec-4795-b33a-a6fe6bfa357e","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1990,"title":"O'Hara, Kathleen M. , journal =. 1990 , publisher =","work_id":"ad6ba07b-fb85-41a9-b018-d314a51c7841","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":19,"snapshot_sha256":"ae120834c98d568633a04da18f251e69c7934efbd13aa69b39e46fedb33fbe80","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":"8f5a7bb6-e5a9-4cb3-874a-2d1decad5049"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:09:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+YCpwWzuBjGuLakF/jjkIOqMRHyUAittRfGcYvq9SMvdAdOm0oTWNA45tK6/bCxm/NP7t2kNOuIB9SrlCZAZDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T23:55:34.280141Z"},"content_sha256":"149c6365d11d4bb5b2a243c27528ae8db62b1d83d9f1c678637af96c5914cdc4","schema_version":"1.0","event_id":"sha256:149c6365d11d4bb5b2a243c27528ae8db62b1d83d9f1c678637af96c5914cdc4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OYFZNS7VIQLNIEEFSK3WOFNRXE/bundle.json","state_url":"https://pith.science/pith/OYFZNS7VIQLNIEEFSK3WOFNRXE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OYFZNS7VIQLNIEEFSK3WOFNRXE/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-07-02T23:55:34Z","links":{"resolver":"https://pith.science/pith/OYFZNS7VIQLNIEEFSK3WOFNRXE","bundle":"https://pith.science/pith/OYFZNS7VIQLNIEEFSK3WOFNRXE/bundle.json","state":"https://pith.science/pith/OYFZNS7VIQLNIEEFSK3WOFNRXE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OYFZNS7VIQLNIEEFSK3WOFNRXE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:OYFZNS7VIQLNIEEFSK3WOFNRXE","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":"cd678e3bd56cb01645c53faa3c527f77b91f317a848ea799750d84dce552f2eb","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-12T23:44:53Z","title_canon_sha256":"fce3a735b96973702fbd214aa60559cf751a51569c56ab413c75be4a3dd28b59"},"schema_version":"1.0","source":{"id":"2605.12822","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.12822","created_at":"2026-05-18T03:09:12Z"},{"alias_kind":"arxiv_version","alias_value":"2605.12822v1","created_at":"2026-05-18T03:09:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.12822","created_at":"2026-05-18T03:09:12Z"},{"alias_kind":"pith_short_12","alias_value":"OYFZNS7VIQLN","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"OYFZNS7VIQLNIEEF","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"OYFZNS7V","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:149c6365d11d4bb5b2a243c27528ae8db62b1d83d9f1c678637af96c5914cdc4","target":"graph","created_at":"2026-05-18T03:09:12Z","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 prove the conjecture for n≤3. For the n=2 case, we give a combinatorial proof of both unimodality and symmetry by defining a nearly symmetric saturated chain decomposition on the set of tilings."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The weighted path-domino tiling model introduced by Bergeron--Ceballos--Küstner correctly interprets the q-Fibonomial coefficients and that the algebraic identities for q-analogs hold without additional restrictions for the small n considered."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"q-Fibonomial coefficients are unimodal for n≤3, with a combinatorial proof of unimodality and symmetry for n=2 via nearly symmetric saturated chain decompositions on tilings and algebraic proofs for n≤3."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"q-Fibonomial coefficients are unimodal for all n at most 3"}],"snapshot_sha256":"1c49ebf161dba205ad0285783d1a171cb3d60d538f944edc324a5145a0b49521"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Bergeron--Ceballos--K\\\"ustner introduced the $q$-Fibonomial coefficients \\( \\qfibonom{m+n}{n}\\), gave a combinatorial interpretation of the $q$-Fibonomial coefficients via a weighted path-domino tiling model, and conjectured that these polynomials are unimodal. We prove the conjecture for $n\\leq3$. For the $n=2$ case, we give a combinatorial proof of both unimodality and symmetry by defining a nearly symmetric saturated chain decomposition on the set of tilings. For all three cases, we give an algebraic proof. Finally, for the $n=3$ case, we establish a more general unimodality result for cert","authors_text":"Brendan B. Connelly, Ezekiel Ito, Kacey Yang, Olha Shevchenko, Thomas C. Martinez","cross_cats":[],"headline":"q-Fibonomial coefficients are unimodal for all n at most 3","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-12T23:44:53Z","title":"Unimodality of $q$-Fibonomial coefficients for small cases"},"references":{"count":19,"internal_anchors":0,"resolved_work":19,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Symmetry, Integrability and Geometry: Methods and Applications , language =","work_id":"e6d816c8-66ed-49b6-835b-a2bb2b2f3052","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Benjamin, Arthur and Quinn, Jennifer J. , address =","work_id":"fa8b6523-cb71-4836-88a7-cacad4c84768","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"1989 , publisher =","work_id":"cbe25d5b-6871-4096-81ac-d3dc98561d85","year":1989},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"1878 , publisher =","work_id":"8d0cca3b-9dec-4795-b33a-a6fe6bfa357e","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"O'Hara, Kathleen M. , journal =. 1990 , publisher =","work_id":"ad6ba07b-fb85-41a9-b018-d314a51c7841","year":1990}],"snapshot_sha256":"ae120834c98d568633a04da18f251e69c7934efbd13aa69b39e46fedb33fbe80"},"source":{"id":"2605.12822","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-14T19:21:27.682099Z","id":"8f5a7bb6-e5a9-4cb3-874a-2d1decad5049","model_set":{"reader":"grok-4.3"},"one_line_summary":"q-Fibonomial coefficients are unimodal for n≤3, with a combinatorial proof of unimodality and symmetry for n=2 via nearly symmetric saturated chain decompositions on tilings and algebraic proofs for n≤3.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"q-Fibonomial coefficients are unimodal for all n at most 3","strongest_claim":"We prove the conjecture for n≤3. For the n=2 case, we give a combinatorial proof of both unimodality and symmetry by defining a nearly symmetric saturated chain decomposition on the set of tilings.","weakest_assumption":"The weighted path-domino tiling model introduced by Bergeron--Ceballos--Küstner correctly interprets the q-Fibonomial coefficients and that the algebraic identities for q-analogs hold without additional restrictions for the small n considered."}},"verdict_id":"8f5a7bb6-e5a9-4cb3-874a-2d1decad5049"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:2abf3fbc131983893af4db628234661589ba0b4af63686a31cb15d87ab3f10a8","target":"record","created_at":"2026-05-18T03:09:12Z","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":"cd678e3bd56cb01645c53faa3c527f77b91f317a848ea799750d84dce552f2eb","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-12T23:44:53Z","title_canon_sha256":"fce3a735b96973702fbd214aa60559cf751a51569c56ab413c75be4a3dd28b59"},"schema_version":"1.0","source":{"id":"2605.12822","kind":"arxiv","version":1}},"canonical_sha256":"760b96cbf54416d4108592b76715b1b915806d27fb0ce81923073f67e5d05aac","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"760b96cbf54416d4108592b76715b1b915806d27fb0ce81923073f67e5d05aac","first_computed_at":"2026-05-18T03:09:12.206552Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:09:12.206552Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6fNhIQ/V+eFv6iNPAzaQ7+F5iaEICdOCfEHMcRqZeRkNPz69wcRS0sp9ksEcT8MxPB4x4ptxIXQ47UY92kPsAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:09:12.207201Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.12822","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2abf3fbc131983893af4db628234661589ba0b4af63686a31cb15d87ab3f10a8","sha256:149c6365d11d4bb5b2a243c27528ae8db62b1d83d9f1c678637af96c5914cdc4"],"state_sha256":"85e834e77dc4991babd6dc4cce13cd441e093713fef9da76b3443ac9730a85a6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pNcbx+uyDI+7YbBcJ6G7BSqp0cNP0Z2qLruOxyNPllM6FuBgrAZWAhWskrCSIteaET7ejOjtrFlmIjYs0BVEAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-02T23:55:34.282826Z","bundle_sha256":"ba5e7579c1bb96c74a612b7d48c5e9a548021284811a3a964a6bdedfa6506d3f"}}