{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:ZVCHAGD4MK6ZGNLHQGTFBLCKEB","short_pith_number":"pith:ZVCHAGD4","schema_version":"1.0","canonical_sha256":"cd4470187c62bd93356781a650ac4a207cac092ad234be7b40520018c228f6ce","source":{"kind":"arxiv","id":"1110.5585","version":2},"attestation_state":"computed","paper":{"title":"A remark on Getzler's semi-classical approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.QA"],"primary_cat":"math.AG","authors_text":"Dan Petersen","submitted_at":"2011-10-25T17:13:18Z","abstract_excerpt":"Ezra Getzler notes in the proof of the main theorem of \"The semi-classical approximation for modular operads\" that \"A proof of the theorem could no doubt be given using [a combinatorial interpretation in terms of a sum over necklaces]; however, we prefer to derive it directly from Theorem 2.2\". In this note we give such a direct combinatorial proof using wreath product symmetric functions."},"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":"1110.5585","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AG","submitted_at":"2011-10-25T17:13:18Z","cross_cats_sorted":["math.QA"],"title_canon_sha256":"97d7ca6742b01f6ad950a0841ba7bfd6bd79a775a6eb5c14b2c59fd0aafd3d5f","abstract_canon_sha256":"efcc957ee95a47ca572a0fccde6a9a89703ed8e192c395b3073eb192716b8b21"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:15:06.785804Z","signature_b64":"EgSvSQfLswu2s6j3SwAe7CqsoYru9ru4dST2Yqc4hn1za3wRD4BOZuJRAG1H+29YTX87p3QnG6rS1yZh386wDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cd4470187c62bd93356781a650ac4a207cac092ad234be7b40520018c228f6ce","last_reissued_at":"2026-05-18T03:15:06.785051Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:15:06.785051Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A remark on Getzler's semi-classical approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.QA"],"primary_cat":"math.AG","authors_text":"Dan Petersen","submitted_at":"2011-10-25T17:13:18Z","abstract_excerpt":"Ezra Getzler notes in the proof of the main theorem of \"The semi-classical approximation for modular operads\" that \"A proof of the theorem could no doubt be given using [a combinatorial interpretation in terms of a sum over necklaces]; however, we prefer to derive it directly from Theorem 2.2\". In this note we give such a direct combinatorial proof using wreath product symmetric functions."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.5585","kind":"arxiv","version":2},"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":"1110.5585","created_at":"2026-05-18T03:15:06.785162+00:00"},{"alias_kind":"arxiv_version","alias_value":"1110.5585v2","created_at":"2026-05-18T03:15:06.785162+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.5585","created_at":"2026-05-18T03:15:06.785162+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZVCHAGD4MK6Z","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZVCHAGD4MK6ZGNLH","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZVCHAGD4","created_at":"2026-05-18T12:26:50.516681+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/ZVCHAGD4MK6ZGNLHQGTFBLCKEB","json":"https://pith.science/pith/ZVCHAGD4MK6ZGNLHQGTFBLCKEB.json","graph_json":"https://pith.science/api/pith-number/ZVCHAGD4MK6ZGNLHQGTFBLCKEB/graph.json","events_json":"https://pith.science/api/pith-number/ZVCHAGD4MK6ZGNLHQGTFBLCKEB/events.json","paper":"https://pith.science/paper/ZVCHAGD4"},"agent_actions":{"view_html":"https://pith.science/pith/ZVCHAGD4MK6ZGNLHQGTFBLCKEB","download_json":"https://pith.science/pith/ZVCHAGD4MK6ZGNLHQGTFBLCKEB.json","view_paper":"https://pith.science/paper/ZVCHAGD4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1110.5585&json=true","fetch_graph":"https://pith.science/api/pith-number/ZVCHAGD4MK6ZGNLHQGTFBLCKEB/graph.json","fetch_events":"https://pith.science/api/pith-number/ZVCHAGD4MK6ZGNLHQGTFBLCKEB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZVCHAGD4MK6ZGNLHQGTFBLCKEB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZVCHAGD4MK6ZGNLHQGTFBLCKEB/action/storage_attestation","attest_author":"https://pith.science/pith/ZVCHAGD4MK6ZGNLHQGTFBLCKEB/action/author_attestation","sign_citation":"https://pith.science/pith/ZVCHAGD4MK6ZGNLHQGTFBLCKEB/action/citation_signature","submit_replication":"https://pith.science/pith/ZVCHAGD4MK6ZGNLHQGTFBLCKEB/action/replication_record"}},"created_at":"2026-05-18T03:15:06.785162+00:00","updated_at":"2026-05-18T03:15:06.785162+00:00"}