{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:XGSLSBJFMSU3ZUNAYDAK5FHXCQ","short_pith_number":"pith:XGSLSBJF","canonical_record":{"source":{"id":"1105.4174","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-05-20T20:40:05Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"553ebf5577fb856d3947e00d0641eb8d2c8199a6606925f2760167c8dbe68463","abstract_canon_sha256":"0775a629a1fe7beb9a2842c9156ed9bc921a4461b21108441fb96ba8551dbe0c"},"schema_version":"1.0"},"canonical_sha256":"b9a4b9052564a9bcd1a0c0c0ae94f7140feeaa4e70847d1311cc25aeacd767e3","source":{"kind":"arxiv","id":"1105.4174","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.4174","created_at":"2026-05-18T04:21:29Z"},{"alias_kind":"arxiv_version","alias_value":"1105.4174v1","created_at":"2026-05-18T04:21:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.4174","created_at":"2026-05-18T04:21:29Z"},{"alias_kind":"pith_short_12","alias_value":"XGSLSBJFMSU3","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"XGSLSBJFMSU3ZUNA","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"XGSLSBJF","created_at":"2026-05-18T12:26:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:XGSLSBJFMSU3ZUNAYDAK5FHXCQ","target":"record","payload":{"canonical_record":{"source":{"id":"1105.4174","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-05-20T20:40:05Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"553ebf5577fb856d3947e00d0641eb8d2c8199a6606925f2760167c8dbe68463","abstract_canon_sha256":"0775a629a1fe7beb9a2842c9156ed9bc921a4461b21108441fb96ba8551dbe0c"},"schema_version":"1.0"},"canonical_sha256":"b9a4b9052564a9bcd1a0c0c0ae94f7140feeaa4e70847d1311cc25aeacd767e3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:21:29.638180Z","signature_b64":"z1PjByf40D8l0D6Q4CMkfa8AC4VM8Kr2LQ5DWZj8A1RwtRRR/WdldY+asLMEaEJTJqmYq1HE9U3cBfb/bxXZDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b9a4b9052564a9bcd1a0c0c0ae94f7140feeaa4e70847d1311cc25aeacd767e3","last_reissued_at":"2026-05-18T04:21:29.637710Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:21:29.637710Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1105.4174","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-18T04:21:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1AUZT/d6Os20Gdkpzob09csNrGDXk+K84u/ruX+my1fy6mPQkb5qY17X5X0mC/KiOrzbvlD5wIxF08Ozg7hXBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T05:33:04.815581Z"},"content_sha256":"c9085a194f084800d36920ff2f0e47302f9fb560c429e23d9da78f3afc191bab","schema_version":"1.0","event_id":"sha256:c9085a194f084800d36920ff2f0e47302f9fb560c429e23d9da78f3afc191bab"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:XGSLSBJFMSU3ZUNAYDAK5FHXCQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the poset of computation rules for nonassociative calculus","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Michel Grabisch, Miguel Couceiro","submitted_at":"2011-05-20T20:40:05Z","abstract_excerpt":"The symmetric maximum, denoted by v, is an extension of the usual max operation so that 0 is the neutral element, and -x is the symmetric (or inverse) of x, i.e., x v(-x)=0. However, such an extension does not preserve the associativity of max. This fact asks for systematic ways of parenthesing (or bracketing) terms of a sequence (with more than two arguments) when using such an extended maximum. We refer to such systematic (predefined) ways of parenthesing as computation rules. As it turns out there are infinitely many computation rules each of which corresponding to a systematic way of brack"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.4174","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":""},"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-18T04:21:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jIgsNrjdKzhvvJDXfQQzxbeFIa+CVGaUx5PcMZgp0HbV8aattPRaIzDdYYiIlJVuhqDLCJVIYuGrD+LK0tFnBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T05:33:04.816207Z"},"content_sha256":"9dddea93ba85be96f30dde147e8e23d180efba99661aacc958d95eda98f8b260","schema_version":"1.0","event_id":"sha256:9dddea93ba85be96f30dde147e8e23d180efba99661aacc958d95eda98f8b260"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XGSLSBJFMSU3ZUNAYDAK5FHXCQ/bundle.json","state_url":"https://pith.science/pith/XGSLSBJFMSU3ZUNAYDAK5FHXCQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XGSLSBJFMSU3ZUNAYDAK5FHXCQ/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-05-27T05:33:04Z","links":{"resolver":"https://pith.science/pith/XGSLSBJFMSU3ZUNAYDAK5FHXCQ","bundle":"https://pith.science/pith/XGSLSBJFMSU3ZUNAYDAK5FHXCQ/bundle.json","state":"https://pith.science/pith/XGSLSBJFMSU3ZUNAYDAK5FHXCQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XGSLSBJFMSU3ZUNAYDAK5FHXCQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:XGSLSBJFMSU3ZUNAYDAK5FHXCQ","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":"0775a629a1fe7beb9a2842c9156ed9bc921a4461b21108441fb96ba8551dbe0c","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-05-20T20:40:05Z","title_canon_sha256":"553ebf5577fb856d3947e00d0641eb8d2c8199a6606925f2760167c8dbe68463"},"schema_version":"1.0","source":{"id":"1105.4174","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.4174","created_at":"2026-05-18T04:21:29Z"},{"alias_kind":"arxiv_version","alias_value":"1105.4174v1","created_at":"2026-05-18T04:21:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.4174","created_at":"2026-05-18T04:21:29Z"},{"alias_kind":"pith_short_12","alias_value":"XGSLSBJFMSU3","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"XGSLSBJFMSU3ZUNA","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"XGSLSBJF","created_at":"2026-05-18T12:26:44Z"}],"graph_snapshots":[{"event_id":"sha256:9dddea93ba85be96f30dde147e8e23d180efba99661aacc958d95eda98f8b260","target":"graph","created_at":"2026-05-18T04:21:29Z","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":"The symmetric maximum, denoted by v, is an extension of the usual max operation so that 0 is the neutral element, and -x is the symmetric (or inverse) of x, i.e., x v(-x)=0. However, such an extension does not preserve the associativity of max. This fact asks for systematic ways of parenthesing (or bracketing) terms of a sequence (with more than two arguments) when using such an extended maximum. We refer to such systematic (predefined) ways of parenthesing as computation rules. As it turns out there are infinitely many computation rules each of which corresponding to a systematic way of brack","authors_text":"Michel Grabisch, Miguel Couceiro","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-05-20T20:40:05Z","title":"On the poset of computation rules for nonassociative calculus"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.4174","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:c9085a194f084800d36920ff2f0e47302f9fb560c429e23d9da78f3afc191bab","target":"record","created_at":"2026-05-18T04:21:29Z","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":"0775a629a1fe7beb9a2842c9156ed9bc921a4461b21108441fb96ba8551dbe0c","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-05-20T20:40:05Z","title_canon_sha256":"553ebf5577fb856d3947e00d0641eb8d2c8199a6606925f2760167c8dbe68463"},"schema_version":"1.0","source":{"id":"1105.4174","kind":"arxiv","version":1}},"canonical_sha256":"b9a4b9052564a9bcd1a0c0c0ae94f7140feeaa4e70847d1311cc25aeacd767e3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b9a4b9052564a9bcd1a0c0c0ae94f7140feeaa4e70847d1311cc25aeacd767e3","first_computed_at":"2026-05-18T04:21:29.637710Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:21:29.637710Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"z1PjByf40D8l0D6Q4CMkfa8AC4VM8Kr2LQ5DWZj8A1RwtRRR/WdldY+asLMEaEJTJqmYq1HE9U3cBfb/bxXZDg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:21:29.638180Z","signed_message":"canonical_sha256_bytes"},"source_id":"1105.4174","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c9085a194f084800d36920ff2f0e47302f9fb560c429e23d9da78f3afc191bab","sha256:9dddea93ba85be96f30dde147e8e23d180efba99661aacc958d95eda98f8b260"],"state_sha256":"1d9f9e9de6d42b28da13273be7687dd8c8e37fdebaa379d216fb9abfa89368d0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fFEp6sx5phBQ5YrX9T2S2a126sHYmnQnPHWpcIZlQ6IMhCiM5d5OTdNUDGHnMy7+L/A+y9eeP1Jjf2gjP//uCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T05:33:04.819502Z","bundle_sha256":"ce10bf5667054ab18bf7dcf78f55b3cb782e6f285f4bb904d6b4a2a8509740bb"}}