{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:YRMU7OIPSP7DJR53K4QXOYFWEA","short_pith_number":"pith:YRMU7OIP","canonical_record":{"source":{"id":"1904.04403","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-09T00:11:27Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"68cdeb767fd8b24a58f4547dbb408c2a891399514908f6f8d54176a1b7b4d0aa","abstract_canon_sha256":"6378ee4ce6656bd77e049fe41572105308f7da79dffc144f7b07c436c23c25bb"},"schema_version":"1.0"},"canonical_sha256":"c4594fb90f93fe34c7bb57217760b6200098f80efb92afd6daf5346f8bba9f1e","source":{"kind":"arxiv","id":"1904.04403","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.04403","created_at":"2026-05-17T23:48:59Z"},{"alias_kind":"arxiv_version","alias_value":"1904.04403v1","created_at":"2026-05-17T23:48:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.04403","created_at":"2026-05-17T23:48:59Z"},{"alias_kind":"pith_short_12","alias_value":"YRMU7OIPSP7D","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"YRMU7OIPSP7DJR53","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"YRMU7OIP","created_at":"2026-05-18T12:33:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:YRMU7OIPSP7DJR53K4QXOYFWEA","target":"record","payload":{"canonical_record":{"source":{"id":"1904.04403","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-09T00:11:27Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"68cdeb767fd8b24a58f4547dbb408c2a891399514908f6f8d54176a1b7b4d0aa","abstract_canon_sha256":"6378ee4ce6656bd77e049fe41572105308f7da79dffc144f7b07c436c23c25bb"},"schema_version":"1.0"},"canonical_sha256":"c4594fb90f93fe34c7bb57217760b6200098f80efb92afd6daf5346f8bba9f1e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:59.090902Z","signature_b64":"umHj2/IzCcoZNbT3+FzDX0D8Y42sXF9lyGGvb17vHVrmrt3n2Z1XSQ86TPHjHoLPnhDHAtEvA01fJ+mLd4rOCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c4594fb90f93fe34c7bb57217760b6200098f80efb92afd6daf5346f8bba9f1e","last_reissued_at":"2026-05-17T23:48:59.090437Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:59.090437Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1904.04403","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-17T23:48:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AF6YZQqFCX4H2YxQPPsDvbDkI1C0LtavK/X52Ohbe87KWVhZg+w586x6xgvEchgZS3vPUVKFPyWbvT+TmlvUAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T05:58:31.899064Z"},"content_sha256":"029be41561be63fea7e0563bc11445b4be9ac6431f7b62668ce2d1dc5bc3db5e","schema_version":"1.0","event_id":"sha256:029be41561be63fea7e0563bc11445b4be9ac6431f7b62668ce2d1dc5bc3db5e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:YRMU7OIPSP7DJR53K4QXOYFWEA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Discovering Bands from Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"Nikolaj Tatti","submitted_at":"2019-04-09T00:11:27Z","abstract_excerpt":"Discovering the underlying structure of a given graph is one of the fundamental goals in graph mining. Given a graph, we can often order vertices in a way that neighboring vertices have a higher probability of being connected to each other. This implies that the edges form a band around the diagonal in the adjacency matrix. Such structure may rise for example if the graph was created over time: each vertex had an active time interval during which the vertex was connected with other active vertices.\n  The goal of this paper is to model this phenomenon. To this end, we formulate an optimization "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.04403","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-17T23:48:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TrG1TljXN9Yn4PeBsXeeY6iUToOS2h8Xx+YXeNYnVxKuJIf7gZhK2VSNJWLTXfKP7dCZTdORA8LpR0pewkPUAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T05:58:31.899564Z"},"content_sha256":"fff047ee14c20ebaa0b38bcfde85453fe4f8c22d3eae348a24c175d36bfcf690","schema_version":"1.0","event_id":"sha256:fff047ee14c20ebaa0b38bcfde85453fe4f8c22d3eae348a24c175d36bfcf690"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YRMU7OIPSP7DJR53K4QXOYFWEA/bundle.json","state_url":"https://pith.science/pith/YRMU7OIPSP7DJR53K4QXOYFWEA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YRMU7OIPSP7DJR53K4QXOYFWEA/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-26T05:58:31Z","links":{"resolver":"https://pith.science/pith/YRMU7OIPSP7DJR53K4QXOYFWEA","bundle":"https://pith.science/pith/YRMU7OIPSP7DJR53K4QXOYFWEA/bundle.json","state":"https://pith.science/pith/YRMU7OIPSP7DJR53K4QXOYFWEA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YRMU7OIPSP7DJR53K4QXOYFWEA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:YRMU7OIPSP7DJR53K4QXOYFWEA","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":"6378ee4ce6656bd77e049fe41572105308f7da79dffc144f7b07c436c23c25bb","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-09T00:11:27Z","title_canon_sha256":"68cdeb767fd8b24a58f4547dbb408c2a891399514908f6f8d54176a1b7b4d0aa"},"schema_version":"1.0","source":{"id":"1904.04403","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.04403","created_at":"2026-05-17T23:48:59Z"},{"alias_kind":"arxiv_version","alias_value":"1904.04403v1","created_at":"2026-05-17T23:48:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.04403","created_at":"2026-05-17T23:48:59Z"},{"alias_kind":"pith_short_12","alias_value":"YRMU7OIPSP7D","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"YRMU7OIPSP7DJR53","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"YRMU7OIP","created_at":"2026-05-18T12:33:33Z"}],"graph_snapshots":[{"event_id":"sha256:fff047ee14c20ebaa0b38bcfde85453fe4f8c22d3eae348a24c175d36bfcf690","target":"graph","created_at":"2026-05-17T23:48:59Z","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":"Discovering the underlying structure of a given graph is one of the fundamental goals in graph mining. Given a graph, we can often order vertices in a way that neighboring vertices have a higher probability of being connected to each other. This implies that the edges form a band around the diagonal in the adjacency matrix. Such structure may rise for example if the graph was created over time: each vertex had an active time interval during which the vertex was connected with other active vertices.\n  The goal of this paper is to model this phenomenon. To this end, we formulate an optimization ","authors_text":"Nikolaj Tatti","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-09T00:11:27Z","title":"Discovering Bands from Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.04403","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:029be41561be63fea7e0563bc11445b4be9ac6431f7b62668ce2d1dc5bc3db5e","target":"record","created_at":"2026-05-17T23:48:59Z","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":"6378ee4ce6656bd77e049fe41572105308f7da79dffc144f7b07c436c23c25bb","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-09T00:11:27Z","title_canon_sha256":"68cdeb767fd8b24a58f4547dbb408c2a891399514908f6f8d54176a1b7b4d0aa"},"schema_version":"1.0","source":{"id":"1904.04403","kind":"arxiv","version":1}},"canonical_sha256":"c4594fb90f93fe34c7bb57217760b6200098f80efb92afd6daf5346f8bba9f1e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c4594fb90f93fe34c7bb57217760b6200098f80efb92afd6daf5346f8bba9f1e","first_computed_at":"2026-05-17T23:48:59.090437Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:48:59.090437Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"umHj2/IzCcoZNbT3+FzDX0D8Y42sXF9lyGGvb17vHVrmrt3n2Z1XSQ86TPHjHoLPnhDHAtEvA01fJ+mLd4rOCA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:48:59.090902Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.04403","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:029be41561be63fea7e0563bc11445b4be9ac6431f7b62668ce2d1dc5bc3db5e","sha256:fff047ee14c20ebaa0b38bcfde85453fe4f8c22d3eae348a24c175d36bfcf690"],"state_sha256":"3949e9d47bc9f3816c0893866ddbec92ff285ae0b118e3ba3c2e051530b0e992"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"98M+IvVveEDrLnLjW8NoKDub94/Q4I5yN1rnKzUA5+0Qp2HrjmWRQwXsURButYJdNmcL0IAu9DAitomosdXaBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T05:58:31.902481Z","bundle_sha256":"efa66fbd4aa83bb0a0126c9cc26cac2b9bddb7c28679bbf18b5ae05cf3beb18e"}}