{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:VO2EZMZKIMQ4S3JTOWTK5YHD6A","short_pith_number":"pith:VO2EZMZK","canonical_record":{"source":{"id":"1710.06298","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-10-17T14:09:26Z","cross_cats_sorted":[],"title_canon_sha256":"ea1e6c9b5150311153c2403c8bc590323b22b8593848c6a1d2b5cdaa072dc1da","abstract_canon_sha256":"ab57ba5850b3a3d6f0a53cf41e40d46c4ff23d52b7668e88151e3bb3c1e3e585"},"schema_version":"1.0"},"canonical_sha256":"abb44cb32a4321c96d3375a6aee0e3f01663832ce04ed375d86db2970e11ec82","source":{"kind":"arxiv","id":"1710.06298","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.06298","created_at":"2026-05-18T00:11:28Z"},{"alias_kind":"arxiv_version","alias_value":"1710.06298v1","created_at":"2026-05-18T00:11:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.06298","created_at":"2026-05-18T00:11:28Z"},{"alias_kind":"pith_short_12","alias_value":"VO2EZMZKIMQ4","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"VO2EZMZKIMQ4S3JT","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"VO2EZMZK","created_at":"2026-05-18T12:31:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:VO2EZMZKIMQ4S3JTOWTK5YHD6A","target":"record","payload":{"canonical_record":{"source":{"id":"1710.06298","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-10-17T14:09:26Z","cross_cats_sorted":[],"title_canon_sha256":"ea1e6c9b5150311153c2403c8bc590323b22b8593848c6a1d2b5cdaa072dc1da","abstract_canon_sha256":"ab57ba5850b3a3d6f0a53cf41e40d46c4ff23d52b7668e88151e3bb3c1e3e585"},"schema_version":"1.0"},"canonical_sha256":"abb44cb32a4321c96d3375a6aee0e3f01663832ce04ed375d86db2970e11ec82","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:11:28.953685Z","signature_b64":"hJKWxjOsTqWO+QRnd8+kb1Ga9PxK0KqW/aI8+c+visNrUVfWx6mGcwLoir62cUSeI01gYrf/ntDBOOCRZ3n+CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"abb44cb32a4321c96d3375a6aee0e3f01663832ce04ed375d86db2970e11ec82","last_reissued_at":"2026-05-18T00:11:28.953309Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:11:28.953309Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.06298","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:11:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q8D5I9sctuxIkm0rT2FYNKk/XALngjk1sjuHR8hY1VQZqMiZ/Yfvlderib6Imd7kubaxRNGQsLV+yWmUgRjECA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T23:16:34.744739Z"},"content_sha256":"e7218dfcc404b9d89c6462445d88118c6228823f275a7e3fbe5b5b00a57110ee","schema_version":"1.0","event_id":"sha256:e7218dfcc404b9d89c6462445d88118c6228823f275a7e3fbe5b5b00a57110ee"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:VO2EZMZKIMQ4S3JTOWTK5YHD6A","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A generative model for sparse, evolving digraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Georgios Papoudakis (SEQUEL), Martin Monperrus (KTH), Philippe Preux (CRIStAL, SEQUEL)","submitted_at":"2017-10-17T14:09:26Z","abstract_excerpt":"Generating graphs that are similar to real ones is an open problem, while the similarity notion is quite elusive and hard to formalize. In this paper, we focus on sparse digraphs and propose SDG, an algorithm that aims at generating graphs similar to real ones. Since real graphs are evolving and this evolution is important to study in order to understand the underlying dynamical system, we tackle the problem of generating series of graphs. We propose SEDGE, an algorithm meant to generate series of graphs similar to a real series. SEDGE is an extension of SDG. We consider graphs that are repres"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.06298","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:11:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jBKVf1aNgqMIOj49bEfb5WdR45avu5cxQjAokH+OX4hu/XnEeze7mxdKan4/By/ytQw0OT6wcr4VCHxDXTBdBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T23:16:34.745247Z"},"content_sha256":"d8aff514ab2b77fff0e9cdd85cc607a69afe538d9d9363c7e9d1416895bf0b40","schema_version":"1.0","event_id":"sha256:d8aff514ab2b77fff0e9cdd85cc607a69afe538d9d9363c7e9d1416895bf0b40"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VO2EZMZKIMQ4S3JTOWTK5YHD6A/bundle.json","state_url":"https://pith.science/pith/VO2EZMZKIMQ4S3JTOWTK5YHD6A/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VO2EZMZKIMQ4S3JTOWTK5YHD6A/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-30T23:16:34Z","links":{"resolver":"https://pith.science/pith/VO2EZMZKIMQ4S3JTOWTK5YHD6A","bundle":"https://pith.science/pith/VO2EZMZKIMQ4S3JTOWTK5YHD6A/bundle.json","state":"https://pith.science/pith/VO2EZMZKIMQ4S3JTOWTK5YHD6A/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VO2EZMZKIMQ4S3JTOWTK5YHD6A/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:VO2EZMZKIMQ4S3JTOWTK5YHD6A","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":"ab57ba5850b3a3d6f0a53cf41e40d46c4ff23d52b7668e88151e3bb3c1e3e585","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-10-17T14:09:26Z","title_canon_sha256":"ea1e6c9b5150311153c2403c8bc590323b22b8593848c6a1d2b5cdaa072dc1da"},"schema_version":"1.0","source":{"id":"1710.06298","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.06298","created_at":"2026-05-18T00:11:28Z"},{"alias_kind":"arxiv_version","alias_value":"1710.06298v1","created_at":"2026-05-18T00:11:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.06298","created_at":"2026-05-18T00:11:28Z"},{"alias_kind":"pith_short_12","alias_value":"VO2EZMZKIMQ4","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"VO2EZMZKIMQ4S3JT","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"VO2EZMZK","created_at":"2026-05-18T12:31:49Z"}],"graph_snapshots":[{"event_id":"sha256:d8aff514ab2b77fff0e9cdd85cc607a69afe538d9d9363c7e9d1416895bf0b40","target":"graph","created_at":"2026-05-18T00:11:28Z","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":"Generating graphs that are similar to real ones is an open problem, while the similarity notion is quite elusive and hard to formalize. In this paper, we focus on sparse digraphs and propose SDG, an algorithm that aims at generating graphs similar to real ones. Since real graphs are evolving and this evolution is important to study in order to understand the underlying dynamical system, we tackle the problem of generating series of graphs. We propose SEDGE, an algorithm meant to generate series of graphs similar to a real series. SEDGE is an extension of SDG. We consider graphs that are repres","authors_text":"Georgios Papoudakis (SEQUEL), Martin Monperrus (KTH), Philippe Preux (CRIStAL, SEQUEL)","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-10-17T14:09:26Z","title":"A generative model for sparse, evolving digraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.06298","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:e7218dfcc404b9d89c6462445d88118c6228823f275a7e3fbe5b5b00a57110ee","target":"record","created_at":"2026-05-18T00:11:28Z","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":"ab57ba5850b3a3d6f0a53cf41e40d46c4ff23d52b7668e88151e3bb3c1e3e585","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-10-17T14:09:26Z","title_canon_sha256":"ea1e6c9b5150311153c2403c8bc590323b22b8593848c6a1d2b5cdaa072dc1da"},"schema_version":"1.0","source":{"id":"1710.06298","kind":"arxiv","version":1}},"canonical_sha256":"abb44cb32a4321c96d3375a6aee0e3f01663832ce04ed375d86db2970e11ec82","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"abb44cb32a4321c96d3375a6aee0e3f01663832ce04ed375d86db2970e11ec82","first_computed_at":"2026-05-18T00:11:28.953309Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:11:28.953309Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hJKWxjOsTqWO+QRnd8+kb1Ga9PxK0KqW/aI8+c+visNrUVfWx6mGcwLoir62cUSeI01gYrf/ntDBOOCRZ3n+CA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:11:28.953685Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.06298","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e7218dfcc404b9d89c6462445d88118c6228823f275a7e3fbe5b5b00a57110ee","sha256:d8aff514ab2b77fff0e9cdd85cc607a69afe538d9d9363c7e9d1416895bf0b40"],"state_sha256":"ba63282204d66b856633ad97317a06aebe77249b5fc2de92517b2d666dec4f83"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Eg6cA0eiwW7RJtLWQv3REQ0O8XLSjabBp+7N1IMQbwHn6FEH9wgIFKDxr+i99NIjQZrsEn3OsbMt/Ot+/mFBDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T23:16:34.748477Z","bundle_sha256":"94b37d2ecd7b931d26d0a1a003f2472a911179ecdbc17f7198fe093203ec0167"}}