{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:APO6GIYNY7KVVFVR6O3OZPVKIR","short_pith_number":"pith:APO6GIYN","canonical_record":{"source":{"id":"2607.01463","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.PR","submitted_at":"2026-07-01T20:47:49Z","cross_cats_sorted":[],"title_canon_sha256":"4e841392bad882cf9f8b142b9586aefc9846af12d15aad97549fc184c73e1640","abstract_canon_sha256":"d8f5afe6fe3f3ac5e23628be1817c62fab318456ad1bcf570fa0643f0325364a"},"schema_version":"1.0"},"canonical_sha256":"03dde3230dc7d55a96b1f3b6ecbeaa444cd5ac1e58d7152f48b39393fd246909","source":{"kind":"arxiv","id":"2607.01463","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.01463","created_at":"2026-07-03T00:17:00Z"},{"alias_kind":"arxiv_version","alias_value":"2607.01463v1","created_at":"2026-07-03T00:17:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.01463","created_at":"2026-07-03T00:17:00Z"},{"alias_kind":"pith_short_12","alias_value":"APO6GIYNY7KV","created_at":"2026-07-03T00:17:00Z"},{"alias_kind":"pith_short_16","alias_value":"APO6GIYNY7KVVFVR","created_at":"2026-07-03T00:17:00Z"},{"alias_kind":"pith_short_8","alias_value":"APO6GIYN","created_at":"2026-07-03T00:17:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:APO6GIYNY7KVVFVR6O3OZPVKIR","target":"record","payload":{"canonical_record":{"source":{"id":"2607.01463","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.PR","submitted_at":"2026-07-01T20:47:49Z","cross_cats_sorted":[],"title_canon_sha256":"4e841392bad882cf9f8b142b9586aefc9846af12d15aad97549fc184c73e1640","abstract_canon_sha256":"d8f5afe6fe3f3ac5e23628be1817c62fab318456ad1bcf570fa0643f0325364a"},"schema_version":"1.0"},"canonical_sha256":"03dde3230dc7d55a96b1f3b6ecbeaa444cd5ac1e58d7152f48b39393fd246909","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-03T00:17:00.899847Z","signature_b64":"wt8nBBVFQRKsnNCWW0iQ/KqrRB2fbeK1XWOSJjKwHx5vBewbsIw1FCPy/ItlunrDGkjZ4JmgtedoFZKMyqH7BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"03dde3230dc7d55a96b1f3b6ecbeaa444cd5ac1e58d7152f48b39393fd246909","last_reissued_at":"2026-07-03T00:17:00.899368Z","signature_status":"signed_v1","first_computed_at":"2026-07-03T00:17:00.899368Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2607.01463","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-03T00:17:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I37fPdE83jN6sm0Qoms6OKXOs4Yd8kyehbmbsyFE7eg+JEL8t9yt5FiZQlOLETlndGaDJSRwY6D5PrzZ7BrUCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-31T14:19:42.038402Z"},"content_sha256":"2bf945bc055bce5e885b617cf5ed98280fc4573df167f1bf78f1e9c2cc2a4a50","schema_version":"1.0","event_id":"sha256:2bf945bc055bce5e885b617cf5ed98280fc4573df167f1bf78f1e9c2cc2a4a50"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:APO6GIYNY7KVVFVR6O3OZPVKIR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Two Multi--Draw Coupon Collector models with different retention rules","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Aristides V. Doumas, S. Spektor","submitted_at":"2026-07-01T20:47:49Z","abstract_excerpt":"In this paper we study two variants of the generalized coupon collector's problem, where our collector receives at each run d distinct coupons and keeps all the new observed coupons (Problem I), while he chooses the least--collected coupon at each run (Problem II). In both cases we derive explicit formulae for the average of the random variable denoting the number of trials for a complete set of N different types of coupons, which are uniformly distributed. In both cases we present the asymptotic expansion up to the fourth term including the corresponding error term. Then, for both problems we"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.01463","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2607.01463/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-03T00:17:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+SRfLOGjEfH0SuiGfp5dqSb6bWELIeDGE4nK14jl+iTd3Kao0qp9M3lZyAdbY6RR0n2UwNfT7QZnKhvmc6lODw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-31T14:19:42.039104Z"},"content_sha256":"55a7ced5d786a4da122726d6ade1f5b6d12349c0a8a974608d72f822602d0a67","schema_version":"1.0","event_id":"sha256:55a7ced5d786a4da122726d6ade1f5b6d12349c0a8a974608d72f822602d0a67"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:APO6GIYNY7KVVFVR6O3OZPVKIR","target":"integrity","payload":{"note":"Identifier '10.1109/tcomm.2024.3506913' is syntactically valid but the DOI registry (doi.org) returned 404, and Crossref / OpenAlex / internal corpus also have no record. The cited work could not be located through any authoritative source.","snippet":"R. Sokolovskii, P. Agarwal, L.A. Croquevielle, Z. Zhou, and T. Heinis, Coding over coupon collector channels for combinatorial motif-based DNA storage,IEEE Transactions on Communications(2024), https://doi.org/10.1109/TCOMM.2024.3506913","arxiv_id":"2607.01463","detector":"doi_compliance","evidence":{"doi":"10.1109/tcomm.2024.3506913","arxiv_id":null,"ref_index":4,"raw_excerpt":"R. Sokolovskii, P. Agarwal, L.A. Croquevielle, Z. Zhou, and T. Heinis, Coding over coupon collector channels for combinatorial motif-based DNA storage,IEEE Transactions on Communications(2024), https://doi.org/10.1109/TCOMM.2024.3506913","verdict_class":"cross_source","checked_sources":["crossref_by_doi","openalex_by_doi","doi_org_head"]},"severity":"critical","ref_index":4,"audited_at":"2026-07-09T09:05:15.047184Z","event_type":"pith.integrity.v1","detected_doi":"10.1109/tcomm.2024.3506913","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"unresolvable_identifier","evidence_hash":"a9db9071c112bfe7c0a829cf660cb1fe068fbc1274abdb93a48b556cd39a2b07","paper_version":1,"verdict_class":"cross_source","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null,"integrity_event_id":8126,"payload_sha256":"319f97ac0ed1bae3532b108de6dc462e17b1d3c4cf0b6f373baf0361e687b2c1","signature_b64":"wXSG+nDIcG4/7NtYk3pSoxm+jSlKkjsMqIWQIZs4ycYkmttD22VzTeWWkJygM4OCcy/Rybfn5keYJuEZVPU5BA==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-09T09:07:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"spJtVPmMtBrhca9/EmQUgnyfClZxdMewJRFP0VPUV06qxigwuIeNM3J8UBFC7/YzlJ6baBzPRdpeeLFcCvw2Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-31T14:19:42.048839Z"},"content_sha256":"71b32bd4deffa7e98b10ae8debc671eb83997aab786452cd54dfaebf0c63bc61","schema_version":"1.0","event_id":"sha256:71b32bd4deffa7e98b10ae8debc671eb83997aab786452cd54dfaebf0c63bc61"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/APO6GIYNY7KVVFVR6O3OZPVKIR/bundle.json","state_url":"https://pith.science/pith/APO6GIYNY7KVVFVR6O3OZPVKIR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/APO6GIYNY7KVVFVR6O3OZPVKIR/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-31T14:19:42Z","links":{"resolver":"https://pith.science/pith/APO6GIYNY7KVVFVR6O3OZPVKIR","bundle":"https://pith.science/pith/APO6GIYNY7KVVFVR6O3OZPVKIR/bundle.json","state":"https://pith.science/pith/APO6GIYNY7KVVFVR6O3OZPVKIR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/APO6GIYNY7KVVFVR6O3OZPVKIR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:APO6GIYNY7KVVFVR6O3OZPVKIR","merge_version":"pith-open-graph-merge-v1","event_count":3,"valid_event_count":3,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"d8f5afe6fe3f3ac5e23628be1817c62fab318456ad1bcf570fa0643f0325364a","cross_cats_sorted":[],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.PR","submitted_at":"2026-07-01T20:47:49Z","title_canon_sha256":"4e841392bad882cf9f8b142b9586aefc9846af12d15aad97549fc184c73e1640"},"schema_version":"1.0","source":{"id":"2607.01463","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.01463","created_at":"2026-07-03T00:17:00Z"},{"alias_kind":"arxiv_version","alias_value":"2607.01463v1","created_at":"2026-07-03T00:17:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.01463","created_at":"2026-07-03T00:17:00Z"},{"alias_kind":"pith_short_12","alias_value":"APO6GIYNY7KV","created_at":"2026-07-03T00:17:00Z"},{"alias_kind":"pith_short_16","alias_value":"APO6GIYNY7KVVFVR","created_at":"2026-07-03T00:17:00Z"},{"alias_kind":"pith_short_8","alias_value":"APO6GIYN","created_at":"2026-07-03T00:17:00Z"}],"graph_snapshots":[{"event_id":"sha256:55a7ced5d786a4da122726d6ade1f5b6d12349c0a8a974608d72f822602d0a67","target":"graph","created_at":"2026-07-03T00:17:00Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2607.01463/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper we study two variants of the generalized coupon collector's problem, where our collector receives at each run d distinct coupons and keeps all the new observed coupons (Problem I), while he chooses the least--collected coupon at each run (Problem II). In both cases we derive explicit formulae for the average of the random variable denoting the number of trials for a complete set of N different types of coupons, which are uniformly distributed. In both cases we present the asymptotic expansion up to the fourth term including the corresponding error term. Then, for both problems we","authors_text":"Aristides V. Doumas, S. Spektor","cross_cats":[],"headline":"","license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.PR","submitted_at":"2026-07-01T20:47:49Z","title":"Two Multi--Draw Coupon Collector models with different retention rules"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.01463","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:2bf945bc055bce5e885b617cf5ed98280fc4573df167f1bf78f1e9c2cc2a4a50","target":"record","created_at":"2026-07-03T00:17:00Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"d8f5afe6fe3f3ac5e23628be1817c62fab318456ad1bcf570fa0643f0325364a","cross_cats_sorted":[],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.PR","submitted_at":"2026-07-01T20:47:49Z","title_canon_sha256":"4e841392bad882cf9f8b142b9586aefc9846af12d15aad97549fc184c73e1640"},"schema_version":"1.0","source":{"id":"2607.01463","kind":"arxiv","version":1}},"canonical_sha256":"03dde3230dc7d55a96b1f3b6ecbeaa444cd5ac1e58d7152f48b39393fd246909","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"03dde3230dc7d55a96b1f3b6ecbeaa444cd5ac1e58d7152f48b39393fd246909","first_computed_at":"2026-07-03T00:17:00.899368Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-03T00:17:00.899368Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wt8nBBVFQRKsnNCWW0iQ/KqrRB2fbeK1XWOSJjKwHx5vBewbsIw1FCPy/ItlunrDGkjZ4JmgtedoFZKMyqH7BA==","signature_status":"signed_v1","signed_at":"2026-07-03T00:17:00.899847Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.01463","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2bf945bc055bce5e885b617cf5ed98280fc4573df167f1bf78f1e9c2cc2a4a50","sha256:55a7ced5d786a4da122726d6ade1f5b6d12349c0a8a974608d72f822602d0a67","sha256:71b32bd4deffa7e98b10ae8debc671eb83997aab786452cd54dfaebf0c63bc61"],"state_sha256":"711329866002a271acca46a0a9f5243f023e2a0c7b4e7815ed1c6186de04383e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qtA90OV61Vk8nOmP7JVPZYH0z7tQchmhsWENQa2OW9jY/2YGG1gXvKwEoLZCkl4x0sXq6lx3pgxZmYLNBKEOBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-31T14:19:42.052525Z","bundle_sha256":"0417b8ac635069842c3a0fdcc9f9c9d72efec13677345e6bad9afdf0d9519018"}}