{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:OUEICC6FQAFOLX5US5BPEC4WQM","short_pith_number":"pith:OUEICC6F","schema_version":"1.0","canonical_sha256":"7508810bc5800ae5dfb49742f20b9683094e4d5a673460efd9bf7198624b5f20","source":{"kind":"arxiv","id":"1310.0838","version":2},"attestation_state":"computed","paper":{"title":"Order polynomials and P\\'olya's enumeration theorem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Katharina Jochemko","submitted_at":"2013-10-02T20:27:42Z","abstract_excerpt":"P\\'olya's enumeration theorem is concerned with counting labeled sets up to symmetry. Given a finite group acting on a finite set of labeled elements it states that the number of labeled sets up to symmetry is given by a polynomial in the number of labels. We give a new perspective on this theorem by generalizing it to partially ordered sets and order preserving maps. Further we prove a reciprocity statement in terms of strictly order preserving maps generalizing a classical result by Stanley (1970). We apply our results to counting graph colorings up to symmetry."},"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":"1310.0838","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-10-02T20:27:42Z","cross_cats_sorted":[],"title_canon_sha256":"875e693dd49af88ed603dd262784ea84f7c591a0fd206bb52f32787b9d11339e","abstract_canon_sha256":"e4c04b3aad28fc979a5131ad302e9fb02e0cc6e24c468aac3254594cecec6f7e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:00:58.423940Z","signature_b64":"ev9XAUwlcb09vuYS980KvbjU1GvCk25qOkwNW9PFG71qQFIwf1AF3C06zQEFShdyaIzooS4eVmW3tkEg9woFCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7508810bc5800ae5dfb49742f20b9683094e4d5a673460efd9bf7198624b5f20","last_reissued_at":"2026-05-18T03:00:58.423457Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:00:58.423457Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Order polynomials and P\\'olya's enumeration theorem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Katharina Jochemko","submitted_at":"2013-10-02T20:27:42Z","abstract_excerpt":"P\\'olya's enumeration theorem is concerned with counting labeled sets up to symmetry. Given a finite group acting on a finite set of labeled elements it states that the number of labeled sets up to symmetry is given by a polynomial in the number of labels. We give a new perspective on this theorem by generalizing it to partially ordered sets and order preserving maps. Further we prove a reciprocity statement in terms of strictly order preserving maps generalizing a classical result by Stanley (1970). We apply our results to counting graph colorings up to symmetry."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.0838","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":"1310.0838","created_at":"2026-05-18T03:00:58.423531+00:00"},{"alias_kind":"arxiv_version","alias_value":"1310.0838v2","created_at":"2026-05-18T03:00:58.423531+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.0838","created_at":"2026-05-18T03:00:58.423531+00:00"},{"alias_kind":"pith_short_12","alias_value":"OUEICC6FQAFO","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_16","alias_value":"OUEICC6FQAFOLX5U","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_8","alias_value":"OUEICC6F","created_at":"2026-05-18T12:27:54.935989+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/OUEICC6FQAFOLX5US5BPEC4WQM","json":"https://pith.science/pith/OUEICC6FQAFOLX5US5BPEC4WQM.json","graph_json":"https://pith.science/api/pith-number/OUEICC6FQAFOLX5US5BPEC4WQM/graph.json","events_json":"https://pith.science/api/pith-number/OUEICC6FQAFOLX5US5BPEC4WQM/events.json","paper":"https://pith.science/paper/OUEICC6F"},"agent_actions":{"view_html":"https://pith.science/pith/OUEICC6FQAFOLX5US5BPEC4WQM","download_json":"https://pith.science/pith/OUEICC6FQAFOLX5US5BPEC4WQM.json","view_paper":"https://pith.science/paper/OUEICC6F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1310.0838&json=true","fetch_graph":"https://pith.science/api/pith-number/OUEICC6FQAFOLX5US5BPEC4WQM/graph.json","fetch_events":"https://pith.science/api/pith-number/OUEICC6FQAFOLX5US5BPEC4WQM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OUEICC6FQAFOLX5US5BPEC4WQM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OUEICC6FQAFOLX5US5BPEC4WQM/action/storage_attestation","attest_author":"https://pith.science/pith/OUEICC6FQAFOLX5US5BPEC4WQM/action/author_attestation","sign_citation":"https://pith.science/pith/OUEICC6FQAFOLX5US5BPEC4WQM/action/citation_signature","submit_replication":"https://pith.science/pith/OUEICC6FQAFOLX5US5BPEC4WQM/action/replication_record"}},"created_at":"2026-05-18T03:00:58.423531+00:00","updated_at":"2026-05-18T03:00:58.423531+00:00"}