{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:PMBMPMXVVN37NNDYINBOD2FMMC","short_pith_number":"pith:PMBMPMXV","canonical_record":{"source":{"id":"1804.10981","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-29T19:39:57Z","cross_cats_sorted":[],"title_canon_sha256":"fd6f66593d75a4a5160a1e469dcc12734b01e4c0b084932912095ee75a764991","abstract_canon_sha256":"2421eaf1debe89b7f12d2bdd820888a963f20fb0577769e8d3cd25797b06d366"},"schema_version":"1.0"},"canonical_sha256":"7b02c7b2f5ab77f6b4784342e1e8ac6091c68daf586f190dac1ad8cbfaa0f1ba","source":{"kind":"arxiv","id":"1804.10981","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.10981","created_at":"2026-05-18T00:17:14Z"},{"alias_kind":"arxiv_version","alias_value":"1804.10981v1","created_at":"2026-05-18T00:17:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.10981","created_at":"2026-05-18T00:17:14Z"},{"alias_kind":"pith_short_12","alias_value":"PMBMPMXVVN37","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"PMBMPMXVVN37NNDY","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"PMBMPMXV","created_at":"2026-05-18T12:32:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:PMBMPMXVVN37NNDYINBOD2FMMC","target":"record","payload":{"canonical_record":{"source":{"id":"1804.10981","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-29T19:39:57Z","cross_cats_sorted":[],"title_canon_sha256":"fd6f66593d75a4a5160a1e469dcc12734b01e4c0b084932912095ee75a764991","abstract_canon_sha256":"2421eaf1debe89b7f12d2bdd820888a963f20fb0577769e8d3cd25797b06d366"},"schema_version":"1.0"},"canonical_sha256":"7b02c7b2f5ab77f6b4784342e1e8ac6091c68daf586f190dac1ad8cbfaa0f1ba","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:14.995561Z","signature_b64":"lqKg2b53WDxGkotegBGCs6IyjF+pJbdXSeHGuNhrEUwFLTXw2hTgBLb+KxdvDniHO0IYUrXUORm9Lskx3914DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7b02c7b2f5ab77f6b4784342e1e8ac6091c68daf586f190dac1ad8cbfaa0f1ba","last_reissued_at":"2026-05-18T00:17:14.995131Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:14.995131Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.10981","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:17:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a+FTj3KDvrgT72MDUPilIudch+UmR278dS9uoycGVHFQ6+6wVUUf7j3cL2Bweiioz77LGzYj3hOUezKFG2+qDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T04:21:29.051601Z"},"content_sha256":"699a5504f11bd2dc6d128cd208f1c89e5e41c52a3fed166f9bc2ffea1c10d2f1","schema_version":"1.0","event_id":"sha256:699a5504f11bd2dc6d128cd208f1c89e5e41c52a3fed166f9bc2ffea1c10d2f1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:PMBMPMXVVN37NNDYINBOD2FMMC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Enumeration of Maximal $(\\Delta, \\gamma)$-Cliques of a Temporal Network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bithika Pal, Suman Banerjee","submitted_at":"2018-04-29T19:39:57Z","abstract_excerpt":"A temporal network is a mathematical way of precisely representing a time varying relationship among a group of agents. In this paper, we introduce the notion of $(\\Delta, \\gamma)$-Cliques of a temporal network, where every pair of vertices present in the clique communicates atleast $\\gamma$ times in each $\\Delta$ period within a given time duration. We present an algorithm for enumerating all such maximal cliques present in the network. We also implement the proposed algorithm with three human contact network data sets. Based on the obtained results, we analyze the data set on multiple values"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.10981","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:17:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6CRaWWdzPPZEJWq+FOWPAoZwPOvIalgP2Z4u13nIXnaPcV/79yiqT8qTdHHW5qQ4N2Qn/0bO4MZqkauN1S8dAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T04:21:29.051941Z"},"content_sha256":"bda17afd8b4a4e1ee2cd86b185b2887f955b0c38d4616f20309cd2d362bc0d91","schema_version":"1.0","event_id":"sha256:bda17afd8b4a4e1ee2cd86b185b2887f955b0c38d4616f20309cd2d362bc0d91"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PMBMPMXVVN37NNDYINBOD2FMMC/bundle.json","state_url":"https://pith.science/pith/PMBMPMXVVN37NNDYINBOD2FMMC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PMBMPMXVVN37NNDYINBOD2FMMC/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-12T04:21:29Z","links":{"resolver":"https://pith.science/pith/PMBMPMXVVN37NNDYINBOD2FMMC","bundle":"https://pith.science/pith/PMBMPMXVVN37NNDYINBOD2FMMC/bundle.json","state":"https://pith.science/pith/PMBMPMXVVN37NNDYINBOD2FMMC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PMBMPMXVVN37NNDYINBOD2FMMC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:PMBMPMXVVN37NNDYINBOD2FMMC","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":"2421eaf1debe89b7f12d2bdd820888a963f20fb0577769e8d3cd25797b06d366","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-29T19:39:57Z","title_canon_sha256":"fd6f66593d75a4a5160a1e469dcc12734b01e4c0b084932912095ee75a764991"},"schema_version":"1.0","source":{"id":"1804.10981","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.10981","created_at":"2026-05-18T00:17:14Z"},{"alias_kind":"arxiv_version","alias_value":"1804.10981v1","created_at":"2026-05-18T00:17:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.10981","created_at":"2026-05-18T00:17:14Z"},{"alias_kind":"pith_short_12","alias_value":"PMBMPMXVVN37","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"PMBMPMXVVN37NNDY","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"PMBMPMXV","created_at":"2026-05-18T12:32:46Z"}],"graph_snapshots":[{"event_id":"sha256:bda17afd8b4a4e1ee2cd86b185b2887f955b0c38d4616f20309cd2d362bc0d91","target":"graph","created_at":"2026-05-18T00:17:14Z","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":"A temporal network is a mathematical way of precisely representing a time varying relationship among a group of agents. In this paper, we introduce the notion of $(\\Delta, \\gamma)$-Cliques of a temporal network, where every pair of vertices present in the clique communicates atleast $\\gamma$ times in each $\\Delta$ period within a given time duration. We present an algorithm for enumerating all such maximal cliques present in the network. We also implement the proposed algorithm with three human contact network data sets. Based on the obtained results, we analyze the data set on multiple values","authors_text":"Bithika Pal, Suman Banerjee","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-29T19:39:57Z","title":"On the Enumeration of Maximal $(\\Delta, \\gamma)$-Cliques of a Temporal Network"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.10981","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:699a5504f11bd2dc6d128cd208f1c89e5e41c52a3fed166f9bc2ffea1c10d2f1","target":"record","created_at":"2026-05-18T00:17:14Z","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":"2421eaf1debe89b7f12d2bdd820888a963f20fb0577769e8d3cd25797b06d366","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-29T19:39:57Z","title_canon_sha256":"fd6f66593d75a4a5160a1e469dcc12734b01e4c0b084932912095ee75a764991"},"schema_version":"1.0","source":{"id":"1804.10981","kind":"arxiv","version":1}},"canonical_sha256":"7b02c7b2f5ab77f6b4784342e1e8ac6091c68daf586f190dac1ad8cbfaa0f1ba","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7b02c7b2f5ab77f6b4784342e1e8ac6091c68daf586f190dac1ad8cbfaa0f1ba","first_computed_at":"2026-05-18T00:17:14.995131Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:17:14.995131Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lqKg2b53WDxGkotegBGCs6IyjF+pJbdXSeHGuNhrEUwFLTXw2hTgBLb+KxdvDniHO0IYUrXUORm9Lskx3914DA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:17:14.995561Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.10981","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:699a5504f11bd2dc6d128cd208f1c89e5e41c52a3fed166f9bc2ffea1c10d2f1","sha256:bda17afd8b4a4e1ee2cd86b185b2887f955b0c38d4616f20309cd2d362bc0d91"],"state_sha256":"63caedb1ec872c48e836f0ea7fe651a6035ee1cb3b9e66847bd127e79dd66697"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6DPtnDR+5UCPUoDIv6M76oQglcFbDLRkB7kZlIHcj/lHE0wP0fbyohmOYUqe0hN3m8LfSrwUvO1vUjV1pxmFAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T04:21:29.053830Z","bundle_sha256":"08f7de222fb98603511e570805b5a734303862a52a99de45687ab39f590a1e65"}}