{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:DZPUVFIH5RDJ5YHLXGML64BSIM","short_pith_number":"pith:DZPUVFIH","canonical_record":{"source":{"id":"1501.02178","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-01-09T15:35:01Z","cross_cats_sorted":[],"title_canon_sha256":"b2752bb0f73baa9b488c22164903829a681c150c51e3510ada3ea12ebc9f0c51","abstract_canon_sha256":"6c32f1f40866d57c4d3c4d945bc825f24ff223566d587ab4433f6726e6489868"},"schema_version":"1.0"},"canonical_sha256":"1e5f4a9507ec469ee0ebb998bf703243190c49a37421e434fee9939b21007798","source":{"kind":"arxiv","id":"1501.02178","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.02178","created_at":"2026-05-18T02:29:44Z"},{"alias_kind":"arxiv_version","alias_value":"1501.02178v1","created_at":"2026-05-18T02:29:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.02178","created_at":"2026-05-18T02:29:44Z"},{"alias_kind":"pith_short_12","alias_value":"DZPUVFIH5RDJ","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"DZPUVFIH5RDJ5YHL","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"DZPUVFIH","created_at":"2026-05-18T12:29:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:DZPUVFIH5RDJ5YHLXGML64BSIM","target":"record","payload":{"canonical_record":{"source":{"id":"1501.02178","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-01-09T15:35:01Z","cross_cats_sorted":[],"title_canon_sha256":"b2752bb0f73baa9b488c22164903829a681c150c51e3510ada3ea12ebc9f0c51","abstract_canon_sha256":"6c32f1f40866d57c4d3c4d945bc825f24ff223566d587ab4433f6726e6489868"},"schema_version":"1.0"},"canonical_sha256":"1e5f4a9507ec469ee0ebb998bf703243190c49a37421e434fee9939b21007798","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:29:44.697561Z","signature_b64":"Cf3MKYO4r4rLSXjhejLlqXmNqDl6TABrAM9jKqBKNEV9IcdG1p02Mze9Jt4dg7eeOsRGG0FM+HlP82srHwBQCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1e5f4a9507ec469ee0ebb998bf703243190c49a37421e434fee9939b21007798","last_reissued_at":"2026-05-18T02:29:44.697111Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:29:44.697111Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1501.02178","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-18T02:29:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TZFJOD5K1pccBmp7HPRFH5SPhmGzmjlLjCRmqxJsgB5225y8Q/Ye8dEuxXJ642u8QZrYiNn+AwzxFNtJ5zllAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T00:21:07.453223Z"},"content_sha256":"084a5fcae6e7653b4411e3e2018847225f12ed533ba890f96c6abd9157616784","schema_version":"1.0","event_id":"sha256:084a5fcae6e7653b4411e3e2018847225f12ed533ba890f96c6abd9157616784"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:DZPUVFIH5RDJ5YHLXGML64BSIM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A note on the transversal size of a series of families constructed over Cycle Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Kaushik Majumder, Satyaki Mukherjee","submitted_at":"2015-01-09T15:35:01Z","abstract_excerpt":"Paul Erd\\H{o}s and L\\'{a}szl\\'{o} Lov\\'{a}sz established by means of an example that there exists a maximal intersecting family of $k-$sets with approximately $(e-1)k!$ blocks. L\\'{a}szl\\'{o} Lov\\'{a}sz conjectured that their example is best known example which has the maximum number of blocks. Later it was disproved. But the quest for such examples remain valid till this date. In this short note, by computing transversal size of a certain series of uniform intersecting families constructed over the cycle graph, we provide an example which has more than $(\\frac{k}{2})^{k-1}$ (approximately) bl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.02178","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-18T02:29:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yZAv4yEdYbDmsq3y+hB5PnbyJf+fWB6GWMYbWY9ESCLHu+XXVfPGNtsqr+LJQpdJZkruMKieSjiSBjeTHJq2Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T00:21:07.453587Z"},"content_sha256":"fd7477468ad11119e097fffc591954516ae336f184cbad766208fd5216e5ce3f","schema_version":"1.0","event_id":"sha256:fd7477468ad11119e097fffc591954516ae336f184cbad766208fd5216e5ce3f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DZPUVFIH5RDJ5YHLXGML64BSIM/bundle.json","state_url":"https://pith.science/pith/DZPUVFIH5RDJ5YHLXGML64BSIM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DZPUVFIH5RDJ5YHLXGML64BSIM/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-24T00:21:07Z","links":{"resolver":"https://pith.science/pith/DZPUVFIH5RDJ5YHLXGML64BSIM","bundle":"https://pith.science/pith/DZPUVFIH5RDJ5YHLXGML64BSIM/bundle.json","state":"https://pith.science/pith/DZPUVFIH5RDJ5YHLXGML64BSIM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DZPUVFIH5RDJ5YHLXGML64BSIM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:DZPUVFIH5RDJ5YHLXGML64BSIM","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":"6c32f1f40866d57c4d3c4d945bc825f24ff223566d587ab4433f6726e6489868","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-01-09T15:35:01Z","title_canon_sha256":"b2752bb0f73baa9b488c22164903829a681c150c51e3510ada3ea12ebc9f0c51"},"schema_version":"1.0","source":{"id":"1501.02178","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.02178","created_at":"2026-05-18T02:29:44Z"},{"alias_kind":"arxiv_version","alias_value":"1501.02178v1","created_at":"2026-05-18T02:29:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.02178","created_at":"2026-05-18T02:29:44Z"},{"alias_kind":"pith_short_12","alias_value":"DZPUVFIH5RDJ","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"DZPUVFIH5RDJ5YHL","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"DZPUVFIH","created_at":"2026-05-18T12:29:17Z"}],"graph_snapshots":[{"event_id":"sha256:fd7477468ad11119e097fffc591954516ae336f184cbad766208fd5216e5ce3f","target":"graph","created_at":"2026-05-18T02:29:44Z","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":"Paul Erd\\H{o}s and L\\'{a}szl\\'{o} Lov\\'{a}sz established by means of an example that there exists a maximal intersecting family of $k-$sets with approximately $(e-1)k!$ blocks. L\\'{a}szl\\'{o} Lov\\'{a}sz conjectured that their example is best known example which has the maximum number of blocks. Later it was disproved. But the quest for such examples remain valid till this date. In this short note, by computing transversal size of a certain series of uniform intersecting families constructed over the cycle graph, we provide an example which has more than $(\\frac{k}{2})^{k-1}$ (approximately) bl","authors_text":"Kaushik Majumder, Satyaki Mukherjee","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-01-09T15:35:01Z","title":"A note on the transversal size of a series of families constructed over Cycle Graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.02178","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:084a5fcae6e7653b4411e3e2018847225f12ed533ba890f96c6abd9157616784","target":"record","created_at":"2026-05-18T02:29:44Z","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":"6c32f1f40866d57c4d3c4d945bc825f24ff223566d587ab4433f6726e6489868","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-01-09T15:35:01Z","title_canon_sha256":"b2752bb0f73baa9b488c22164903829a681c150c51e3510ada3ea12ebc9f0c51"},"schema_version":"1.0","source":{"id":"1501.02178","kind":"arxiv","version":1}},"canonical_sha256":"1e5f4a9507ec469ee0ebb998bf703243190c49a37421e434fee9939b21007798","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1e5f4a9507ec469ee0ebb998bf703243190c49a37421e434fee9939b21007798","first_computed_at":"2026-05-18T02:29:44.697111Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:29:44.697111Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Cf3MKYO4r4rLSXjhejLlqXmNqDl6TABrAM9jKqBKNEV9IcdG1p02Mze9Jt4dg7eeOsRGG0FM+HlP82srHwBQCw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:29:44.697561Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.02178","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:084a5fcae6e7653b4411e3e2018847225f12ed533ba890f96c6abd9157616784","sha256:fd7477468ad11119e097fffc591954516ae336f184cbad766208fd5216e5ce3f"],"state_sha256":"7249d021d11f9779a82366d91937d6cb778bac1373dc9e9ad215d31bad277f1a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O+xLOH/vTNeU9xl/qN772H1oZk7oBTJySC7KmvyccWgG8/jaWP9YqiV3W17iACfEQ4jQ6pPEYTU/1GYmsI03BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T00:21:07.455799Z","bundle_sha256":"9132917ae1f9bbb2681364662498598513f10d72ef24b4447defb746c4ace430"}}