{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:A42JXOFWLCH7YBHZPNV2ZQRTJ3","short_pith_number":"pith:A42JXOFW","canonical_record":{"source":{"id":"1808.02273","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-08-07T09:20:20Z","cross_cats_sorted":[],"title_canon_sha256":"75a79f9226c6176c0424560ef7b78f2b3b839ae9ea79dbd1400e0b7646e12194","abstract_canon_sha256":"274bbf22e47e92644c5d648091f5de1f64918b920f0f1ddbd34b964829ee2fec"},"schema_version":"1.0"},"canonical_sha256":"07349bb8b6588ffc04f97b6bacc2334ede996432568c1e3fd0bb56cd81fce7f9","source":{"kind":"arxiv","id":"1808.02273","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.02273","created_at":"2026-05-18T00:08:47Z"},{"alias_kind":"arxiv_version","alias_value":"1808.02273v1","created_at":"2026-05-18T00:08:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.02273","created_at":"2026-05-18T00:08:47Z"},{"alias_kind":"pith_short_12","alias_value":"A42JXOFWLCH7","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"A42JXOFWLCH7YBHZ","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"A42JXOFW","created_at":"2026-05-18T12:32:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:A42JXOFWLCH7YBHZPNV2ZQRTJ3","target":"record","payload":{"canonical_record":{"source":{"id":"1808.02273","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-08-07T09:20:20Z","cross_cats_sorted":[],"title_canon_sha256":"75a79f9226c6176c0424560ef7b78f2b3b839ae9ea79dbd1400e0b7646e12194","abstract_canon_sha256":"274bbf22e47e92644c5d648091f5de1f64918b920f0f1ddbd34b964829ee2fec"},"schema_version":"1.0"},"canonical_sha256":"07349bb8b6588ffc04f97b6bacc2334ede996432568c1e3fd0bb56cd81fce7f9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:47.029268Z","signature_b64":"KOnkpU+S9MIuxyGpn6Et8Z47eolIvT8bCdnryXkRFpAKFUxKNzVBswhiehmlZNP2SlQrCt7YRLEQBREmbSW/Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"07349bb8b6588ffc04f97b6bacc2334ede996432568c1e3fd0bb56cd81fce7f9","last_reissued_at":"2026-05-18T00:08:47.028677Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:47.028677Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.02273","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-05-18T00:08:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mZKf8082I0NIJmmHSXdOTkHrnQrQACgi8HUmWSP1hU7gU5Y1lKK55EBxU3owb2V8vZP6OXQD1s9pVIrThATnBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T22:16:07.086193Z"},"content_sha256":"8b37ff65e596f57ac877aff193ec6aee131c7ba3500ed09a9fe07501d5a48a69","schema_version":"1.0","event_id":"sha256:8b37ff65e596f57ac877aff193ec6aee131c7ba3500ed09a9fe07501d5a48a69"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:A42JXOFWLCH7YBHZPNV2ZQRTJ3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Partially perfect hash functions for intersecting families","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Tapas Kumar Mishra","submitted_at":"2018-08-07T09:20:20Z","abstract_excerpt":"Consider a large network with unknown number of nodes. Some of these nodes coordinate to perform tasks. The number of such coordination groups is also unknown. The only information about the network available is that any two coordinating groups share at least $t$ nodes. To complete a particular task in a day, at least $p$ nodes of the corresponding coordinating group must get different time slots out of the $r$ available slots per day. Is there a way of estimating the number of days required such that every coordinating group gets at least one day where it can complete the task? As it turns ou"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.02273","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":""},"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-05-18T00:08:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/Lq3nXcBDLq0xcbqqPZlWBUy9JnE0Hglidx/fDEQWYGcDM1VHaxv/8iDS5IJV6trJHOSszv2sz0vnswROWxvAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T22:16:07.086558Z"},"content_sha256":"13dd3dfb79b3e2f3f60c3d134879c4401e4f6574d603df48bf5ab65f0237c655","schema_version":"1.0","event_id":"sha256:13dd3dfb79b3e2f3f60c3d134879c4401e4f6574d603df48bf5ab65f0237c655"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/A42JXOFWLCH7YBHZPNV2ZQRTJ3/bundle.json","state_url":"https://pith.science/pith/A42JXOFWLCH7YBHZPNV2ZQRTJ3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/A42JXOFWLCH7YBHZPNV2ZQRTJ3/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-06-29T22:16:07Z","links":{"resolver":"https://pith.science/pith/A42JXOFWLCH7YBHZPNV2ZQRTJ3","bundle":"https://pith.science/pith/A42JXOFWLCH7YBHZPNV2ZQRTJ3/bundle.json","state":"https://pith.science/pith/A42JXOFWLCH7YBHZPNV2ZQRTJ3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/A42JXOFWLCH7YBHZPNV2ZQRTJ3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:A42JXOFWLCH7YBHZPNV2ZQRTJ3","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"274bbf22e47e92644c5d648091f5de1f64918b920f0f1ddbd34b964829ee2fec","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-08-07T09:20:20Z","title_canon_sha256":"75a79f9226c6176c0424560ef7b78f2b3b839ae9ea79dbd1400e0b7646e12194"},"schema_version":"1.0","source":{"id":"1808.02273","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.02273","created_at":"2026-05-18T00:08:47Z"},{"alias_kind":"arxiv_version","alias_value":"1808.02273v1","created_at":"2026-05-18T00:08:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.02273","created_at":"2026-05-18T00:08:47Z"},{"alias_kind":"pith_short_12","alias_value":"A42JXOFWLCH7","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"A42JXOFWLCH7YBHZ","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"A42JXOFW","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:13dd3dfb79b3e2f3f60c3d134879c4401e4f6574d603df48bf5ab65f0237c655","target":"graph","created_at":"2026-05-18T00:08:47Z","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"},"paper":{"abstract_excerpt":"Consider a large network with unknown number of nodes. Some of these nodes coordinate to perform tasks. The number of such coordination groups is also unknown. The only information about the network available is that any two coordinating groups share at least $t$ nodes. To complete a particular task in a day, at least $p$ nodes of the corresponding coordinating group must get different time slots out of the $r$ available slots per day. Is there a way of estimating the number of days required such that every coordinating group gets at least one day where it can complete the task? As it turns ou","authors_text":"Tapas Kumar Mishra","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-08-07T09:20:20Z","title":"Partially perfect hash functions for intersecting families"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.02273","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:8b37ff65e596f57ac877aff193ec6aee131c7ba3500ed09a9fe07501d5a48a69","target":"record","created_at":"2026-05-18T00:08:47Z","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":"274bbf22e47e92644c5d648091f5de1f64918b920f0f1ddbd34b964829ee2fec","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-08-07T09:20:20Z","title_canon_sha256":"75a79f9226c6176c0424560ef7b78f2b3b839ae9ea79dbd1400e0b7646e12194"},"schema_version":"1.0","source":{"id":"1808.02273","kind":"arxiv","version":1}},"canonical_sha256":"07349bb8b6588ffc04f97b6bacc2334ede996432568c1e3fd0bb56cd81fce7f9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"07349bb8b6588ffc04f97b6bacc2334ede996432568c1e3fd0bb56cd81fce7f9","first_computed_at":"2026-05-18T00:08:47.028677Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:08:47.028677Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KOnkpU+S9MIuxyGpn6Et8Z47eolIvT8bCdnryXkRFpAKFUxKNzVBswhiehmlZNP2SlQrCt7YRLEQBREmbSW/Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:08:47.029268Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.02273","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8b37ff65e596f57ac877aff193ec6aee131c7ba3500ed09a9fe07501d5a48a69","sha256:13dd3dfb79b3e2f3f60c3d134879c4401e4f6574d603df48bf5ab65f0237c655"],"state_sha256":"c76241905a4cad26d1bc72e14d1ee6dafd4118e9514f3c702e8258434ae86639"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hn0aohJe8CVWOjiAEND1CggHppuwXWN7qKzfEPWPc1j6Mj8j3tjl73xgV7ab80wv70IGkCtG8xyuEeqOaHsgCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T22:16:07.088405Z","bundle_sha256":"6d77054466442948701736a5a5ad05ea9830d14da130cbc1c40ca473030b1c6f"}}