{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:WDRMJP5GV5MHIA4YJVBV3NAHGN","short_pith_number":"pith:WDRMJP5G","schema_version":"1.0","canonical_sha256":"b0e2c4bfa6af587403984d435db4073349572dfa50fce7f139b956dadb943433","source":{"kind":"arxiv","id":"1306.6733","version":4},"attestation_state":"computed","paper":{"title":"A Formality quasi-isomorphism for Hochschild cochains over rationals can be constructed recursively","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NT","math.QA"],"primary_cat":"math.KT","authors_text":"Vasily Dolgushev","submitted_at":"2013-06-28T07:03:36Z","abstract_excerpt":"It is believed arXiv:0808.2762, arXiv:math/9904055 that, among the coefficients entering Kontsevich's formality quasi-isomorphism arXiv:q-alg/9709040, there are irrational (possibly even transcendental) numbers. In this paper, we prove that a formality quasi-isomorphism for Hochschild cochains of a polynomial algebra over rationals can be constructed recursively. The proof that the proposed recursive algorithm works, is based on the existence of formality quasi-isomorphism over reals. However, the algorithm requires no explicit knowledge of the coefficients entering Kontsevich's construction. "},"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":"1306.6733","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.KT","submitted_at":"2013-06-28T07:03:36Z","cross_cats_sorted":["math.NT","math.QA"],"title_canon_sha256":"e08eee1b0289bf57643bcecc8e266fec1ef8a7d82f4244d9b8d7a46993dd3157","abstract_canon_sha256":"c3ac12192e80217c1a28984ee11a7312d22d3e233a40e43601a1c8d4d97e3bdf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:03.612841Z","signature_b64":"EpO2DZ0oNwcrMOmxkDlr18NMbehpszAja3efIuNAvvMI47qQM3VVOgDsGukj5zRYSbe7F7x2BSY5nMQuJ7zVCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b0e2c4bfa6af587403984d435db4073349572dfa50fce7f139b956dadb943433","last_reissued_at":"2026-05-18T00:51:03.612391Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:03.612391Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Formality quasi-isomorphism for Hochschild cochains over rationals can be constructed recursively","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NT","math.QA"],"primary_cat":"math.KT","authors_text":"Vasily Dolgushev","submitted_at":"2013-06-28T07:03:36Z","abstract_excerpt":"It is believed arXiv:0808.2762, arXiv:math/9904055 that, among the coefficients entering Kontsevich's formality quasi-isomorphism arXiv:q-alg/9709040, there are irrational (possibly even transcendental) numbers. In this paper, we prove that a formality quasi-isomorphism for Hochschild cochains of a polynomial algebra over rationals can be constructed recursively. The proof that the proposed recursive algorithm works, is based on the existence of formality quasi-isomorphism over reals. However, the algorithm requires no explicit knowledge of the coefficients entering Kontsevich's construction. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.6733","kind":"arxiv","version":4},"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":"1306.6733","created_at":"2026-05-18T00:51:03.612465+00:00"},{"alias_kind":"arxiv_version","alias_value":"1306.6733v4","created_at":"2026-05-18T00:51:03.612465+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.6733","created_at":"2026-05-18T00:51:03.612465+00:00"},{"alias_kind":"pith_short_12","alias_value":"WDRMJP5GV5MH","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_16","alias_value":"WDRMJP5GV5MHIA4Y","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_8","alias_value":"WDRMJP5G","created_at":"2026-05-18T12:28:04.890932+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.08253","citing_title":"M. Kontsevich's graph complexes and universal structures on graded symplectic manifolds","ref_index":33,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WDRMJP5GV5MHIA4YJVBV3NAHGN","json":"https://pith.science/pith/WDRMJP5GV5MHIA4YJVBV3NAHGN.json","graph_json":"https://pith.science/api/pith-number/WDRMJP5GV5MHIA4YJVBV3NAHGN/graph.json","events_json":"https://pith.science/api/pith-number/WDRMJP5GV5MHIA4YJVBV3NAHGN/events.json","paper":"https://pith.science/paper/WDRMJP5G"},"agent_actions":{"view_html":"https://pith.science/pith/WDRMJP5GV5MHIA4YJVBV3NAHGN","download_json":"https://pith.science/pith/WDRMJP5GV5MHIA4YJVBV3NAHGN.json","view_paper":"https://pith.science/paper/WDRMJP5G","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1306.6733&json=true","fetch_graph":"https://pith.science/api/pith-number/WDRMJP5GV5MHIA4YJVBV3NAHGN/graph.json","fetch_events":"https://pith.science/api/pith-number/WDRMJP5GV5MHIA4YJVBV3NAHGN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WDRMJP5GV5MHIA4YJVBV3NAHGN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WDRMJP5GV5MHIA4YJVBV3NAHGN/action/storage_attestation","attest_author":"https://pith.science/pith/WDRMJP5GV5MHIA4YJVBV3NAHGN/action/author_attestation","sign_citation":"https://pith.science/pith/WDRMJP5GV5MHIA4YJVBV3NAHGN/action/citation_signature","submit_replication":"https://pith.science/pith/WDRMJP5GV5MHIA4YJVBV3NAHGN/action/replication_record"}},"created_at":"2026-05-18T00:51:03.612465+00:00","updated_at":"2026-05-18T00:51:03.612465+00:00"}