{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:OCHR7ODWFHSRQ42WKXHK5PP6XZ","short_pith_number":"pith:OCHR7ODW","schema_version":"1.0","canonical_sha256":"708f1fb87629e518735655ceaebdfebe4f49511cfd6f120c470878fa1800d7e0","source":{"kind":"arxiv","id":"1705.02857","version":1},"attestation_state":"computed","paper":{"title":"A Combinatorial Approach to the Opposite Bi-Free Partial $S$-Transform","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.FA"],"primary_cat":"math.OA","authors_text":"Paul Skoufranis","submitted_at":"2017-05-08T13:12:33Z","abstract_excerpt":"In this paper, we present a combinatorial approach to the opposite 2-variable bi-free partial $S$-transforms where the opposite multiplication is used on the right. In addition, extensions of this partial $S$-transforms to the conditional bi-free and operator-valued bi-free settings are discussed."},"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":"1705.02857","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OA","submitted_at":"2017-05-08T13:12:33Z","cross_cats_sorted":["math.FA"],"title_canon_sha256":"10f786199de0bc30bff610a5265417301c15031ac005528d6ab25ac57a1aa19b","abstract_canon_sha256":"41e678d2b438394dc9e143bc5750e361197b2ba343addb0c0f0ce1c6409d2006"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:36.845554Z","signature_b64":"Uc2iC6+EcZNq/nPe5e1qPNFIY3Z6Y6IYq2jOnw7wY1adkvb2fsBNYDHilrWDOtijfSUPuR6hbsGMaAQCR5ueCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"708f1fb87629e518735655ceaebdfebe4f49511cfd6f120c470878fa1800d7e0","last_reissued_at":"2026-05-17T23:54:36.845039Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:36.845039Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Combinatorial Approach to the Opposite Bi-Free Partial $S$-Transform","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.FA"],"primary_cat":"math.OA","authors_text":"Paul Skoufranis","submitted_at":"2017-05-08T13:12:33Z","abstract_excerpt":"In this paper, we present a combinatorial approach to the opposite 2-variable bi-free partial $S$-transforms where the opposite multiplication is used on the right. In addition, extensions of this partial $S$-transforms to the conditional bi-free and operator-valued bi-free settings are discussed."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.02857","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":"1705.02857","created_at":"2026-05-17T23:54:36.845126+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.02857v1","created_at":"2026-05-17T23:54:36.845126+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.02857","created_at":"2026-05-17T23:54:36.845126+00:00"},{"alias_kind":"pith_short_12","alias_value":"OCHR7ODWFHSR","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_16","alias_value":"OCHR7ODWFHSRQ42W","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_8","alias_value":"OCHR7ODW","created_at":"2026-05-18T12:31:34.259226+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/OCHR7ODWFHSRQ42WKXHK5PP6XZ","json":"https://pith.science/pith/OCHR7ODWFHSRQ42WKXHK5PP6XZ.json","graph_json":"https://pith.science/api/pith-number/OCHR7ODWFHSRQ42WKXHK5PP6XZ/graph.json","events_json":"https://pith.science/api/pith-number/OCHR7ODWFHSRQ42WKXHK5PP6XZ/events.json","paper":"https://pith.science/paper/OCHR7ODW"},"agent_actions":{"view_html":"https://pith.science/pith/OCHR7ODWFHSRQ42WKXHK5PP6XZ","download_json":"https://pith.science/pith/OCHR7ODWFHSRQ42WKXHK5PP6XZ.json","view_paper":"https://pith.science/paper/OCHR7ODW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.02857&json=true","fetch_graph":"https://pith.science/api/pith-number/OCHR7ODWFHSRQ42WKXHK5PP6XZ/graph.json","fetch_events":"https://pith.science/api/pith-number/OCHR7ODWFHSRQ42WKXHK5PP6XZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OCHR7ODWFHSRQ42WKXHK5PP6XZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OCHR7ODWFHSRQ42WKXHK5PP6XZ/action/storage_attestation","attest_author":"https://pith.science/pith/OCHR7ODWFHSRQ42WKXHK5PP6XZ/action/author_attestation","sign_citation":"https://pith.science/pith/OCHR7ODWFHSRQ42WKXHK5PP6XZ/action/citation_signature","submit_replication":"https://pith.science/pith/OCHR7ODWFHSRQ42WKXHK5PP6XZ/action/replication_record"}},"created_at":"2026-05-17T23:54:36.845126+00:00","updated_at":"2026-05-17T23:54:36.845126+00:00"}