{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:MQ23LHDA2AI6DGYLC5Z4M673BM","short_pith_number":"pith:MQ23LHDA","canonical_record":{"source":{"id":"2606.13158","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2026-06-11T10:27:55Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"e02b938dfcb9d3cf2b997238540d162b4ce96bcf73d27ece36940ce58be60872","abstract_canon_sha256":"89be6cb8543e7a2573f4acbc7a8f006d64116dd00e2a1fd74f57bf62e16d7b4f"},"schema_version":"1.0"},"canonical_sha256":"6435b59c60d011e19b0b1773c67bfb0b144690391cbe06f63c9a5c64d0a8bb2b","source":{"kind":"arxiv","id":"2606.13158","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.13158","created_at":"2026-06-12T01:09:43Z"},{"alias_kind":"arxiv_version","alias_value":"2606.13158v1","created_at":"2026-06-12T01:09:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.13158","created_at":"2026-06-12T01:09:43Z"},{"alias_kind":"pith_short_12","alias_value":"MQ23LHDA2AI6","created_at":"2026-06-12T01:09:43Z"},{"alias_kind":"pith_short_16","alias_value":"MQ23LHDA2AI6DGYL","created_at":"2026-06-12T01:09:43Z"},{"alias_kind":"pith_short_8","alias_value":"MQ23LHDA","created_at":"2026-06-12T01:09:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:MQ23LHDA2AI6DGYLC5Z4M673BM","target":"record","payload":{"canonical_record":{"source":{"id":"2606.13158","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2026-06-11T10:27:55Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"e02b938dfcb9d3cf2b997238540d162b4ce96bcf73d27ece36940ce58be60872","abstract_canon_sha256":"89be6cb8543e7a2573f4acbc7a8f006d64116dd00e2a1fd74f57bf62e16d7b4f"},"schema_version":"1.0"},"canonical_sha256":"6435b59c60d011e19b0b1773c67bfb0b144690391cbe06f63c9a5c64d0a8bb2b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-12T01:09:43.984502Z","signature_b64":"9kCk7RUqT6AMyc4g172myCNndH6as9iJSKema3hsxzBAQFeAV+00E1lns+Hr52P2/rV0AxSpDeo8+Rv7Q+7iDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6435b59c60d011e19b0b1773c67bfb0b144690391cbe06f63c9a5c64d0a8bb2b","last_reissued_at":"2026-06-12T01:09:43.983495Z","signature_status":"signed_v1","first_computed_at":"2026-06-12T01:09:43.983495Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.13158","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-06-12T01:09:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6BtMC1qaSLr/NhuIhAMme1Yb2DYp6Bzv5yTQRc4j41qVlCQVBiU57s1iV5Y0kWE9v2nH3Mk7K26W0fHiu9ZgCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T17:53:32.653209Z"},"content_sha256":"40cc78c4d9103c69228233107167fdb3fff09b8c84b64b6e0f0d9d7406f1a416","schema_version":"1.0","event_id":"sha256:40cc78c4d9103c69228233107167fdb3fff09b8c84b64b6e0f0d9d7406f1a416"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:MQ23LHDA2AI6DGYLC5Z4M673BM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Counting Sequence of Z-convex Polyominoes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DM","authors_text":"Luca Castelli (University of Insubria), Paolo Massazza (University of Insubria)","submitted_at":"2026-06-11T10:27:55Z","abstract_excerpt":"The degree of convexity of a convex polyomino P is the smallest integer k such that any two cells of P can be joined by a monotone path inside P with at most k changes of direction. In this paper, we present a set of formulas and equations that are the basis of a C++ program that allows you to compute the longest counting sequence known to date (with respect to the area) of convex polyominoes of degree of convexity at most 2"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.13158","kind":"arxiv","version":1},"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/2606.13158/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-06-12T01:09:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LnP85pXuoGTN5Rm1m8x1T9CIk7M51TT6zkZn/OnQXu0jmkh2nXvJlpOWUdzz7UiIKr7TMFzu78tlfe/2mag/CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T17:53:32.653827Z"},"content_sha256":"8109c2105610602ee62935f1c10275bf985cd28767403886059be5d488a74061","schema_version":"1.0","event_id":"sha256:8109c2105610602ee62935f1c10275bf985cd28767403886059be5d488a74061"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MQ23LHDA2AI6DGYLC5Z4M673BM/bundle.json","state_url":"https://pith.science/pith/MQ23LHDA2AI6DGYLC5Z4M673BM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MQ23LHDA2AI6DGYLC5Z4M673BM/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-30T17:53:32Z","links":{"resolver":"https://pith.science/pith/MQ23LHDA2AI6DGYLC5Z4M673BM","bundle":"https://pith.science/pith/MQ23LHDA2AI6DGYLC5Z4M673BM/bundle.json","state":"https://pith.science/pith/MQ23LHDA2AI6DGYLC5Z4M673BM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MQ23LHDA2AI6DGYLC5Z4M673BM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:MQ23LHDA2AI6DGYLC5Z4M673BM","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":"89be6cb8543e7a2573f4acbc7a8f006d64116dd00e2a1fd74f57bf62e16d7b4f","cross_cats_sorted":["cs.CG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2026-06-11T10:27:55Z","title_canon_sha256":"e02b938dfcb9d3cf2b997238540d162b4ce96bcf73d27ece36940ce58be60872"},"schema_version":"1.0","source":{"id":"2606.13158","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.13158","created_at":"2026-06-12T01:09:43Z"},{"alias_kind":"arxiv_version","alias_value":"2606.13158v1","created_at":"2026-06-12T01:09:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.13158","created_at":"2026-06-12T01:09:43Z"},{"alias_kind":"pith_short_12","alias_value":"MQ23LHDA2AI6","created_at":"2026-06-12T01:09:43Z"},{"alias_kind":"pith_short_16","alias_value":"MQ23LHDA2AI6DGYL","created_at":"2026-06-12T01:09:43Z"},{"alias_kind":"pith_short_8","alias_value":"MQ23LHDA","created_at":"2026-06-12T01:09:43Z"}],"graph_snapshots":[{"event_id":"sha256:8109c2105610602ee62935f1c10275bf985cd28767403886059be5d488a74061","target":"graph","created_at":"2026-06-12T01:09:43Z","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/2606.13158/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The degree of convexity of a convex polyomino P is the smallest integer k such that any two cells of P can be joined by a monotone path inside P with at most k changes of direction. In this paper, we present a set of formulas and equations that are the basis of a C++ program that allows you to compute the longest counting sequence known to date (with respect to the area) of convex polyominoes of degree of convexity at most 2","authors_text":"Luca Castelli (University of Insubria), Paolo Massazza (University of Insubria)","cross_cats":["cs.CG"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2026-06-11T10:27:55Z","title":"On the Counting Sequence of Z-convex Polyominoes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.13158","kind":"arxiv","version":1},"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:40cc78c4d9103c69228233107167fdb3fff09b8c84b64b6e0f0d9d7406f1a416","target":"record","created_at":"2026-06-12T01:09:43Z","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":"89be6cb8543e7a2573f4acbc7a8f006d64116dd00e2a1fd74f57bf62e16d7b4f","cross_cats_sorted":["cs.CG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2026-06-11T10:27:55Z","title_canon_sha256":"e02b938dfcb9d3cf2b997238540d162b4ce96bcf73d27ece36940ce58be60872"},"schema_version":"1.0","source":{"id":"2606.13158","kind":"arxiv","version":1}},"canonical_sha256":"6435b59c60d011e19b0b1773c67bfb0b144690391cbe06f63c9a5c64d0a8bb2b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6435b59c60d011e19b0b1773c67bfb0b144690391cbe06f63c9a5c64d0a8bb2b","first_computed_at":"2026-06-12T01:09:43.983495Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-12T01:09:43.983495Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9kCk7RUqT6AMyc4g172myCNndH6as9iJSKema3hsxzBAQFeAV+00E1lns+Hr52P2/rV0AxSpDeo8+Rv7Q+7iDA==","signature_status":"signed_v1","signed_at":"2026-06-12T01:09:43.984502Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.13158","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:40cc78c4d9103c69228233107167fdb3fff09b8c84b64b6e0f0d9d7406f1a416","sha256:8109c2105610602ee62935f1c10275bf985cd28767403886059be5d488a74061"],"state_sha256":"642e0b6a76539b693b958836c2a8166f57466381e9e8da1c57d50c6be3551c13"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"by6ZHdkvKSKxZ55iO2lzRXOX4m0qBEpmghkHlS1OtSpavShrSOmG3m5zrYm172vO6kiKXHnYTwUrL3BXs5+RCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T17:53:32.656419Z","bundle_sha256":"c930a5c58e49ecfbcdbec960f3695c066507c8eb38a99c7a52bf9e2f5e8081e5"}}