{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:UFTHZOXGVGT2MICRYX7YIWSYPN","short_pith_number":"pith:UFTHZOXG","canonical_record":{"source":{"id":"1707.04341","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.RA","submitted_at":"2017-07-13T22:12:36Z","cross_cats_sorted":[],"title_canon_sha256":"f1217354541e20dc5735a29c178341c8ae83061562a35cda1de504425b01f3e0","abstract_canon_sha256":"1e27105719c3d4f275d661eebd133e0d22c6864bf73adb53d4b0aba12bd957eb"},"schema_version":"1.0"},"canonical_sha256":"a1667cbae6a9a7a62051c5ff845a587b5c0cd00ad5afd40844a2dcf2d23fb7d7","source":{"kind":"arxiv","id":"1707.04341","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.04341","created_at":"2026-05-18T00:06:41Z"},{"alias_kind":"arxiv_version","alias_value":"1707.04341v3","created_at":"2026-05-18T00:06:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.04341","created_at":"2026-05-18T00:06:41Z"},{"alias_kind":"pith_short_12","alias_value":"UFTHZOXGVGT2","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"UFTHZOXGVGT2MICR","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"UFTHZOXG","created_at":"2026-05-18T12:31:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:UFTHZOXGVGT2MICRYX7YIWSYPN","target":"record","payload":{"canonical_record":{"source":{"id":"1707.04341","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.RA","submitted_at":"2017-07-13T22:12:36Z","cross_cats_sorted":[],"title_canon_sha256":"f1217354541e20dc5735a29c178341c8ae83061562a35cda1de504425b01f3e0","abstract_canon_sha256":"1e27105719c3d4f275d661eebd133e0d22c6864bf73adb53d4b0aba12bd957eb"},"schema_version":"1.0"},"canonical_sha256":"a1667cbae6a9a7a62051c5ff845a587b5c0cd00ad5afd40844a2dcf2d23fb7d7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:41.689058Z","signature_b64":"6E2L1tULpWVRyql7hTlVbFvrYOZrzRUjCyBdRSU3rB4bq0JQg+UTsBz4dfn3tYeE/qovj4ZCmh3aiM0RFpBsCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a1667cbae6a9a7a62051c5ff845a587b5c0cd00ad5afd40844a2dcf2d23fb7d7","last_reissued_at":"2026-05-18T00:06:41.688572Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:41.688572Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.04341","source_version":3,"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-18T00:06:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V2hmhEetu5R0QcQgcneG8YKBeXfkK7sIqwsmwGInAQErLSTxBw6Fb8o5u0NJJSxLfh0uRyEF1EIGuCC6AT8DBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T15:05:32.789934Z"},"content_sha256":"9c455d6927a910f734619484056630ef2042155b6f53f82743d0845c3cc4d648","schema_version":"1.0","event_id":"sha256:9c455d6927a910f734619484056630ef2042155b6f53f82743d0845c3cc4d648"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:UFTHZOXGVGT2MICRYX7YIWSYPN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Associative idempotent nondecreasing functions are reducible","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.RA","authors_text":"G\\'abor Somlai, Gergely Kiss","submitted_at":"2017-07-13T22:12:36Z","abstract_excerpt":"An $n$-ary associative function is called reducible if it can be written as a composition of a binary associative function. We summarize known results when the function is defined on a chain and is nondecreasing. Our main result shows that associative idempotent and nondecreasing functions are uniquely reducible."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.04341","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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-05-18T00:06:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bujlr6RXZ063ADGWL09q2B9eEzm2p/QWcQWeGUilxjRVNslfAj3eqX1srZ2kLptaZACGd7eyV2TnpzhL5sjVAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T15:05:32.790281Z"},"content_sha256":"9c603bac54cc55b58e981046ef4e4d72aa2804f15d017e8ca86200b50907a68a","schema_version":"1.0","event_id":"sha256:9c603bac54cc55b58e981046ef4e4d72aa2804f15d017e8ca86200b50907a68a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UFTHZOXGVGT2MICRYX7YIWSYPN/bundle.json","state_url":"https://pith.science/pith/UFTHZOXGVGT2MICRYX7YIWSYPN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UFTHZOXGVGT2MICRYX7YIWSYPN/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-24T15:05:32Z","links":{"resolver":"https://pith.science/pith/UFTHZOXGVGT2MICRYX7YIWSYPN","bundle":"https://pith.science/pith/UFTHZOXGVGT2MICRYX7YIWSYPN/bundle.json","state":"https://pith.science/pith/UFTHZOXGVGT2MICRYX7YIWSYPN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UFTHZOXGVGT2MICRYX7YIWSYPN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:UFTHZOXGVGT2MICRYX7YIWSYPN","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":"1e27105719c3d4f275d661eebd133e0d22c6864bf73adb53d4b0aba12bd957eb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.RA","submitted_at":"2017-07-13T22:12:36Z","title_canon_sha256":"f1217354541e20dc5735a29c178341c8ae83061562a35cda1de504425b01f3e0"},"schema_version":"1.0","source":{"id":"1707.04341","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.04341","created_at":"2026-05-18T00:06:41Z"},{"alias_kind":"arxiv_version","alias_value":"1707.04341v3","created_at":"2026-05-18T00:06:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.04341","created_at":"2026-05-18T00:06:41Z"},{"alias_kind":"pith_short_12","alias_value":"UFTHZOXGVGT2","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"UFTHZOXGVGT2MICR","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"UFTHZOXG","created_at":"2026-05-18T12:31:46Z"}],"graph_snapshots":[{"event_id":"sha256:9c603bac54cc55b58e981046ef4e4d72aa2804f15d017e8ca86200b50907a68a","target":"graph","created_at":"2026-05-18T00:06:41Z","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"},"paper":{"abstract_excerpt":"An $n$-ary associative function is called reducible if it can be written as a composition of a binary associative function. We summarize known results when the function is defined on a chain and is nondecreasing. Our main result shows that associative idempotent and nondecreasing functions are uniquely reducible.","authors_text":"G\\'abor Somlai, Gergely Kiss","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.RA","submitted_at":"2017-07-13T22:12:36Z","title":"Associative idempotent nondecreasing functions are reducible"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.04341","kind":"arxiv","version":3},"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:9c455d6927a910f734619484056630ef2042155b6f53f82743d0845c3cc4d648","target":"record","created_at":"2026-05-18T00:06:41Z","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":"1e27105719c3d4f275d661eebd133e0d22c6864bf73adb53d4b0aba12bd957eb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.RA","submitted_at":"2017-07-13T22:12:36Z","title_canon_sha256":"f1217354541e20dc5735a29c178341c8ae83061562a35cda1de504425b01f3e0"},"schema_version":"1.0","source":{"id":"1707.04341","kind":"arxiv","version":3}},"canonical_sha256":"a1667cbae6a9a7a62051c5ff845a587b5c0cd00ad5afd40844a2dcf2d23fb7d7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a1667cbae6a9a7a62051c5ff845a587b5c0cd00ad5afd40844a2dcf2d23fb7d7","first_computed_at":"2026-05-18T00:06:41.688572Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:06:41.688572Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6E2L1tULpWVRyql7hTlVbFvrYOZrzRUjCyBdRSU3rB4bq0JQg+UTsBz4dfn3tYeE/qovj4ZCmh3aiM0RFpBsCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:06:41.689058Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.04341","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9c455d6927a910f734619484056630ef2042155b6f53f82743d0845c3cc4d648","sha256:9c603bac54cc55b58e981046ef4e4d72aa2804f15d017e8ca86200b50907a68a"],"state_sha256":"7cbedd40da65e1739898a4398b3b0747736bf1f993864d3a7259da286701c949"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J9J6T5rTt7Xfy2vCr9GkycUGzjf3XRJKjkHeuG4ZcoahCk+EHc0xzRZs5fZtjdEHd20ii2rPMakSysRtTNbUDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T15:05:32.792172Z","bundle_sha256":"77c566c8c09bf960b93aae22fd5b65cf6eb75f57c38f0bf362e75f4c0e36839b"}}