{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:MT7PYJAHEL3CH4S5BHUJCAGKBK","short_pith_number":"pith:MT7PYJAH","schema_version":"1.0","canonical_sha256":"64fefc240722f623f25d09e89100ca0a91170d910be11871ce62f200f56abed1","source":{"kind":"arxiv","id":"1605.06485","version":2},"attestation_state":"computed","paper":{"title":"Multicolour Poisson Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Alexander E. Holroyd, Gideon Amir, Omer Angel","submitted_at":"2016-05-20T19:39:23Z","abstract_excerpt":"Consider several independent Poisson point processes on R^d, each with a different colour and perhaps a different intensity, and suppose we are given a set of allowed family types, each of which is a multiset of colours such as red-blue or red-red-green. We study translation-invariant schemes for partitioning the points into families of allowed types. This generalizes the 1-colour and 2-colour matching schemes studied previously (where the sets of allowed family types are the singletons {red-red} and {red-blue} respectively). We characterize when such a scheme exists, as well as the optimal ta"},"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":"1605.06485","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-05-20T19:39:23Z","cross_cats_sorted":[],"title_canon_sha256":"9cd9f4d01f8c3da041b150e24947de2819b7ef8c67e24bc595987ded8aee68cc","abstract_canon_sha256":"f4c340ab71bb07bc75836909c0c2d1d974a27bfafc472efe8e3ca642751c8ec3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:13:37.417428Z","signature_b64":"ScXfhrqTodOBQNoTf9tDIqMX43zZ6vlNq2kxcpnBSwFlEc4xMqZVxGLbGmBqHHm1RWcsrrOimyC3RRCp4+B8DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"64fefc240722f623f25d09e89100ca0a91170d910be11871ce62f200f56abed1","last_reissued_at":"2026-05-18T01:13:37.416658Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:13:37.416658Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multicolour Poisson Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Alexander E. Holroyd, Gideon Amir, Omer Angel","submitted_at":"2016-05-20T19:39:23Z","abstract_excerpt":"Consider several independent Poisson point processes on R^d, each with a different colour and perhaps a different intensity, and suppose we are given a set of allowed family types, each of which is a multiset of colours such as red-blue or red-red-green. We study translation-invariant schemes for partitioning the points into families of allowed types. This generalizes the 1-colour and 2-colour matching schemes studied previously (where the sets of allowed family types are the singletons {red-red} and {red-blue} respectively). We characterize when such a scheme exists, as well as the optimal ta"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.06485","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":"1605.06485","created_at":"2026-05-18T01:13:37.416786+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.06485v2","created_at":"2026-05-18T01:13:37.416786+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.06485","created_at":"2026-05-18T01:13:37.416786+00:00"},{"alias_kind":"pith_short_12","alias_value":"MT7PYJAHEL3C","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_16","alias_value":"MT7PYJAHEL3CH4S5","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_8","alias_value":"MT7PYJAH","created_at":"2026-05-18T12:30:32.724797+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/MT7PYJAHEL3CH4S5BHUJCAGKBK","json":"https://pith.science/pith/MT7PYJAHEL3CH4S5BHUJCAGKBK.json","graph_json":"https://pith.science/api/pith-number/MT7PYJAHEL3CH4S5BHUJCAGKBK/graph.json","events_json":"https://pith.science/api/pith-number/MT7PYJAHEL3CH4S5BHUJCAGKBK/events.json","paper":"https://pith.science/paper/MT7PYJAH"},"agent_actions":{"view_html":"https://pith.science/pith/MT7PYJAHEL3CH4S5BHUJCAGKBK","download_json":"https://pith.science/pith/MT7PYJAHEL3CH4S5BHUJCAGKBK.json","view_paper":"https://pith.science/paper/MT7PYJAH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.06485&json=true","fetch_graph":"https://pith.science/api/pith-number/MT7PYJAHEL3CH4S5BHUJCAGKBK/graph.json","fetch_events":"https://pith.science/api/pith-number/MT7PYJAHEL3CH4S5BHUJCAGKBK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MT7PYJAHEL3CH4S5BHUJCAGKBK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MT7PYJAHEL3CH4S5BHUJCAGKBK/action/storage_attestation","attest_author":"https://pith.science/pith/MT7PYJAHEL3CH4S5BHUJCAGKBK/action/author_attestation","sign_citation":"https://pith.science/pith/MT7PYJAHEL3CH4S5BHUJCAGKBK/action/citation_signature","submit_replication":"https://pith.science/pith/MT7PYJAHEL3CH4S5BHUJCAGKBK/action/replication_record"}},"created_at":"2026-05-18T01:13:37.416786+00:00","updated_at":"2026-05-18T01:13:37.416786+00:00"}