{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:IGSTXVYQAEJ46YQF4R5544L7NI","short_pith_number":"pith:IGSTXVYQ","schema_version":"1.0","canonical_sha256":"41a53bd7100113cf6205e47bde717f6a3a87d0757bb0eef2d148436feb13f069","source":{"kind":"arxiv","id":"1505.01087","version":1},"attestation_state":"computed","paper":{"title":"Poly-infix operators and operator families","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.HO","authors_text":"Alban Ponse, Jan A. Bergstra","submitted_at":"2015-05-05T17:20:16Z","abstract_excerpt":"Poly-infix operators and operator families are introduced as an alternative for working modulo associativity and the corresponding bracket deletion convention. Poly-infix operators represent the basic intuition of repetitively connecting an ordered sequence of entities with the same connecting primitive."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1505.01087","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.HO","submitted_at":"2015-05-05T17:20:16Z","cross_cats_sorted":[],"title_canon_sha256":"d12a6826714daebce91746318fda1474c4e5ae96cbc5b3b79c2f9f05db8c6be3","abstract_canon_sha256":"42c41b0b90ae802514c9fb2ec763236af60c979c9f037c0e0061b5af0bc0f641"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:16:51.988918Z","signature_b64":"g5/zuCh7LGF2qTtLltquNc+MnsWLVF2X4sDauoDerbh85nmVqlQ4pxwjDK08NtJbdx3GySbFHsDN+L1g1HodBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"41a53bd7100113cf6205e47bde717f6a3a87d0757bb0eef2d148436feb13f069","last_reissued_at":"2026-05-18T02:16:51.988229Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:16:51.988229Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Poly-infix operators and operator families","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.HO","authors_text":"Alban Ponse, Jan A. Bergstra","submitted_at":"2015-05-05T17:20:16Z","abstract_excerpt":"Poly-infix operators and operator families are introduced as an alternative for working modulo associativity and the corresponding bracket deletion convention. Poly-infix operators represent the basic intuition of repetitively connecting an ordered sequence of entities with the same connecting primitive."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.01087","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1505.01087","created_at":"2026-05-18T02:16:51.988336+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.01087v1","created_at":"2026-05-18T02:16:51.988336+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.01087","created_at":"2026-05-18T02:16:51.988336+00:00"},{"alias_kind":"pith_short_12","alias_value":"IGSTXVYQAEJ4","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_16","alias_value":"IGSTXVYQAEJ46YQF","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_8","alias_value":"IGSTXVYQ","created_at":"2026-05-18T12:29:25.134429+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IGSTXVYQAEJ46YQF4R5544L7NI","json":"https://pith.science/pith/IGSTXVYQAEJ46YQF4R5544L7NI.json","graph_json":"https://pith.science/api/pith-number/IGSTXVYQAEJ46YQF4R5544L7NI/graph.json","events_json":"https://pith.science/api/pith-number/IGSTXVYQAEJ46YQF4R5544L7NI/events.json","paper":"https://pith.science/paper/IGSTXVYQ"},"agent_actions":{"view_html":"https://pith.science/pith/IGSTXVYQAEJ46YQF4R5544L7NI","download_json":"https://pith.science/pith/IGSTXVYQAEJ46YQF4R5544L7NI.json","view_paper":"https://pith.science/paper/IGSTXVYQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.01087&json=true","fetch_graph":"https://pith.science/api/pith-number/IGSTXVYQAEJ46YQF4R5544L7NI/graph.json","fetch_events":"https://pith.science/api/pith-number/IGSTXVYQAEJ46YQF4R5544L7NI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IGSTXVYQAEJ46YQF4R5544L7NI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IGSTXVYQAEJ46YQF4R5544L7NI/action/storage_attestation","attest_author":"https://pith.science/pith/IGSTXVYQAEJ46YQF4R5544L7NI/action/author_attestation","sign_citation":"https://pith.science/pith/IGSTXVYQAEJ46YQF4R5544L7NI/action/citation_signature","submit_replication":"https://pith.science/pith/IGSTXVYQAEJ46YQF4R5544L7NI/action/replication_record"}},"created_at":"2026-05-18T02:16:51.988336+00:00","updated_at":"2026-05-18T02:16:51.988336+00:00"}