{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:3YOA2AXHLJL53SMOKTDCJL4NTB","short_pith_number":"pith:3YOA2AXH","canonical_record":{"source":{"id":"1808.09317","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-08-28T14:15:24Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"d8e9fb110961c659cb6d821d243393082cded0fa17bed4331429e3c7ba4a45fe","abstract_canon_sha256":"4b74b51d9c42b0b4c173fc1fb0879b4637500005402ebff5d320a8ca06df7d9a"},"schema_version":"1.0"},"canonical_sha256":"de1c0d02e75a57ddc98e54c624af8d985f9ae565be17f1dfd8c11a566dcc2935","source":{"kind":"arxiv","id":"1808.09317","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.09317","created_at":"2026-05-18T00:05:45Z"},{"alias_kind":"arxiv_version","alias_value":"1808.09317v2","created_at":"2026-05-18T00:05:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.09317","created_at":"2026-05-18T00:05:45Z"},{"alias_kind":"pith_short_12","alias_value":"3YOA2AXHLJL5","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"3YOA2AXHLJL53SMO","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"3YOA2AXH","created_at":"2026-05-18T12:32:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:3YOA2AXHLJL53SMOKTDCJL4NTB","target":"record","payload":{"canonical_record":{"source":{"id":"1808.09317","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-08-28T14:15:24Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"d8e9fb110961c659cb6d821d243393082cded0fa17bed4331429e3c7ba4a45fe","abstract_canon_sha256":"4b74b51d9c42b0b4c173fc1fb0879b4637500005402ebff5d320a8ca06df7d9a"},"schema_version":"1.0"},"canonical_sha256":"de1c0d02e75a57ddc98e54c624af8d985f9ae565be17f1dfd8c11a566dcc2935","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:45.042136Z","signature_b64":"dDrZhGnu0ipv+oaDTdUUAOYfjplBezrLYATc04KbNT7Z1gbRYaP7R5TivBrF1IgX8KihyCLyf9AbN19Rq25iAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"de1c0d02e75a57ddc98e54c624af8d985f9ae565be17f1dfd8c11a566dcc2935","last_reissued_at":"2026-05-18T00:05:45.041524Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:45.041524Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.09317","source_version":2,"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:05:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yNsxjqNCGwX/+uqM72wTneVqD2oLeZkfvcbgZa5jV3WuiBpsCIfbf0EiVMq0ivyr4CEv75LJFecAOtyi8fR9AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T13:57:56.249437Z"},"content_sha256":"b9aaf8d29668b1b9eff02b175bcd428d726d291914323e7b8de9abc3426c6e2e","schema_version":"1.0","event_id":"sha256:b9aaf8d29668b1b9eff02b175bcd428d726d291914323e7b8de9abc3426c6e2e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:3YOA2AXHLJL53SMOKTDCJL4NTB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Finding events in temporal networks: Segmentation meets densest-subgraph discovery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.SI","authors_text":"Aristides Gionis, Francesco Bonchi, Mauro Sozio, Nikolaj Tatti, Polina Rozenshtein","submitted_at":"2018-08-28T14:15:24Z","abstract_excerpt":"In this paper we study the problem of discovering a timeline of events in a temporal network. We model events as dense subgraphs that occur within intervals of network activity. We formulate the event-discovery task as an optimization problem, where we search for a partition of the network timeline into k non-overlapping intervals, such that the intervals span subgraphs with maximum total density. The output is a sequence of dense subgraphs along with corresponding time intervals, capturing the most interesting events during the network lifetime.\n  A naive solution to our optimization problem "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.09317","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"},"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:05:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dupiBLg4mGfQonvaEGZ4H4o9PnjF00+O5pS/+zAIO+PI+ORqgl/yxeTicF8vwVsbEGP4sRWwnzqr39PIHsIoBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T13:57:56.250097Z"},"content_sha256":"0af11606b994721b71a01728ae281968bcdcef12c10fa932c93a4ec9a2fba1e6","schema_version":"1.0","event_id":"sha256:0af11606b994721b71a01728ae281968bcdcef12c10fa932c93a4ec9a2fba1e6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3YOA2AXHLJL53SMOKTDCJL4NTB/bundle.json","state_url":"https://pith.science/pith/3YOA2AXHLJL53SMOKTDCJL4NTB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3YOA2AXHLJL53SMOKTDCJL4NTB/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-05-26T13:57:56Z","links":{"resolver":"https://pith.science/pith/3YOA2AXHLJL53SMOKTDCJL4NTB","bundle":"https://pith.science/pith/3YOA2AXHLJL53SMOKTDCJL4NTB/bundle.json","state":"https://pith.science/pith/3YOA2AXHLJL53SMOKTDCJL4NTB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3YOA2AXHLJL53SMOKTDCJL4NTB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:3YOA2AXHLJL53SMOKTDCJL4NTB","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":"4b74b51d9c42b0b4c173fc1fb0879b4637500005402ebff5d320a8ca06df7d9a","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-08-28T14:15:24Z","title_canon_sha256":"d8e9fb110961c659cb6d821d243393082cded0fa17bed4331429e3c7ba4a45fe"},"schema_version":"1.0","source":{"id":"1808.09317","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.09317","created_at":"2026-05-18T00:05:45Z"},{"alias_kind":"arxiv_version","alias_value":"1808.09317v2","created_at":"2026-05-18T00:05:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.09317","created_at":"2026-05-18T00:05:45Z"},{"alias_kind":"pith_short_12","alias_value":"3YOA2AXHLJL5","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"3YOA2AXHLJL53SMO","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"3YOA2AXH","created_at":"2026-05-18T12:32:05Z"}],"graph_snapshots":[{"event_id":"sha256:0af11606b994721b71a01728ae281968bcdcef12c10fa932c93a4ec9a2fba1e6","target":"graph","created_at":"2026-05-18T00:05:45Z","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":"In this paper we study the problem of discovering a timeline of events in a temporal network. We model events as dense subgraphs that occur within intervals of network activity. We formulate the event-discovery task as an optimization problem, where we search for a partition of the network timeline into k non-overlapping intervals, such that the intervals span subgraphs with maximum total density. The output is a sequence of dense subgraphs along with corresponding time intervals, capturing the most interesting events during the network lifetime.\n  A naive solution to our optimization problem ","authors_text":"Aristides Gionis, Francesco Bonchi, Mauro Sozio, Nikolaj Tatti, Polina Rozenshtein","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-08-28T14:15:24Z","title":"Finding events in temporal networks: Segmentation meets densest-subgraph discovery"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.09317","kind":"arxiv","version":2},"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:b9aaf8d29668b1b9eff02b175bcd428d726d291914323e7b8de9abc3426c6e2e","target":"record","created_at":"2026-05-18T00:05:45Z","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":"4b74b51d9c42b0b4c173fc1fb0879b4637500005402ebff5d320a8ca06df7d9a","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-08-28T14:15:24Z","title_canon_sha256":"d8e9fb110961c659cb6d821d243393082cded0fa17bed4331429e3c7ba4a45fe"},"schema_version":"1.0","source":{"id":"1808.09317","kind":"arxiv","version":2}},"canonical_sha256":"de1c0d02e75a57ddc98e54c624af8d985f9ae565be17f1dfd8c11a566dcc2935","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"de1c0d02e75a57ddc98e54c624af8d985f9ae565be17f1dfd8c11a566dcc2935","first_computed_at":"2026-05-18T00:05:45.041524Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:05:45.041524Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dDrZhGnu0ipv+oaDTdUUAOYfjplBezrLYATc04KbNT7Z1gbRYaP7R5TivBrF1IgX8KihyCLyf9AbN19Rq25iAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:05:45.042136Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.09317","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b9aaf8d29668b1b9eff02b175bcd428d726d291914323e7b8de9abc3426c6e2e","sha256:0af11606b994721b71a01728ae281968bcdcef12c10fa932c93a4ec9a2fba1e6"],"state_sha256":"3c7e905898070f141d5403e7351d34700a9055b4f90ec46116ac06ab9c22b046"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WpaBiwIrbviwJUhOdJBEroh3i8Psjg5QDLI/OJhh3UKhJsQ5OPvuycHbiETi+vQER133J7z/otQS5YufDISDCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T13:57:56.253490Z","bundle_sha256":"3bfab4306fe83b38dcceeeca07fef5136a35f550dd9bc47fc8d074bbe6f52f70"}}