{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:FO4OFTRFD6IXJT32BGW33LWZYJ","short_pith_number":"pith:FO4OFTRF","canonical_record":{"source":{"id":"1312.4676","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2013-12-17T07:47:14Z","cross_cats_sorted":[],"title_canon_sha256":"dac64ef2ea5e60433f1aac3ca415e2ee8d3d6c4495480fdc8967a10d8ec8b7b9","abstract_canon_sha256":"b57c791764e152506a573520241f6d02db94592094bb91c279064bec41312c61"},"schema_version":"1.0"},"canonical_sha256":"2bb8e2ce251f9174cf7a09adbdaed9c24ac4cea6dc2604699c167ab6ec1383fe","source":{"kind":"arxiv","id":"1312.4676","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.4676","created_at":"2026-05-18T03:04:23Z"},{"alias_kind":"arxiv_version","alias_value":"1312.4676v1","created_at":"2026-05-18T03:04:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.4676","created_at":"2026-05-18T03:04:23Z"},{"alias_kind":"pith_short_12","alias_value":"FO4OFTRFD6IX","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"FO4OFTRFD6IXJT32","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"FO4OFTRF","created_at":"2026-05-18T12:27:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:FO4OFTRFD6IXJT32BGW33LWZYJ","target":"record","payload":{"canonical_record":{"source":{"id":"1312.4676","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2013-12-17T07:47:14Z","cross_cats_sorted":[],"title_canon_sha256":"dac64ef2ea5e60433f1aac3ca415e2ee8d3d6c4495480fdc8967a10d8ec8b7b9","abstract_canon_sha256":"b57c791764e152506a573520241f6d02db94592094bb91c279064bec41312c61"},"schema_version":"1.0"},"canonical_sha256":"2bb8e2ce251f9174cf7a09adbdaed9c24ac4cea6dc2604699c167ab6ec1383fe","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:04:23.373530Z","signature_b64":"yd2KnuKHURt8jFhWyJtWkzHbpGvzcfaQMehvCatf7qk5nQAduGMu1+H57m6YwKVvB9nz2nNKKvVkI8Q1xn3FDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2bb8e2ce251f9174cf7a09adbdaed9c24ac4cea6dc2604699c167ab6ec1383fe","last_reissued_at":"2026-05-18T03:04:23.373134Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:04:23.373134Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1312.4676","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-18T03:04:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iTqc7x4UGhXEa47flFnKwn8n1Q4CK0tMYBsyDjRRy/7TwyK+LyOcMs98eVZZEKqBaB1UX78SzDQxjc94sUllCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T20:48:19.977851Z"},"content_sha256":"13713250d115bc8bcbb42dc052b4c1f31d91e64f6dada0645d3e95c907f52b9c","schema_version":"1.0","event_id":"sha256:13713250d115bc8bcbb42dc052b4c1f31d91e64f6dada0645d3e95c907f52b9c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:FO4OFTRFD6IXJT32BGW33LWZYJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Une m\\'ethode pour caract\\'eriser les communaut\\'es des r\\'eseaux dynamiques \\`a attributs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"G\\\"unce Keziban Orman, Jean-Fran\\c{c}ois Boulicaut (LIRIS), Marc Plantevit (LIRIS), Vincent Labatut","submitted_at":"2013-12-17T07:47:14Z","abstract_excerpt":"Many complex systems are modeled through complex networks whose analysis reveals typical topological properties. Amongst those, the community structure is one of the most studied. Many methods are proposed to detect communities, not only in plain, but also in attributed, directed or even dynamic networks. A community structure takes the form of a partition of the node set, which must then be characterized relatively to the properties of the studied system. We propose a method to support such a characterization task. We define a sequence-based representation of networks, combining temporal info"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.4676","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-18T03:04:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VA1YIjqWzKRYDMbsKWfO2GdiTF7YjWG9r7WaRa7sbMi7ocWSe6+o//2f1GyNWvmsEhNT98WRUCkEiSJpDLadCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T20:48:19.978583Z"},"content_sha256":"397403e31247cc7f8d8e6a8614e0693101c1701133eae93dca3cb05ff238668d","schema_version":"1.0","event_id":"sha256:397403e31247cc7f8d8e6a8614e0693101c1701133eae93dca3cb05ff238668d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FO4OFTRFD6IXJT32BGW33LWZYJ/bundle.json","state_url":"https://pith.science/pith/FO4OFTRFD6IXJT32BGW33LWZYJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FO4OFTRFD6IXJT32BGW33LWZYJ/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-27T20:48:19Z","links":{"resolver":"https://pith.science/pith/FO4OFTRFD6IXJT32BGW33LWZYJ","bundle":"https://pith.science/pith/FO4OFTRFD6IXJT32BGW33LWZYJ/bundle.json","state":"https://pith.science/pith/FO4OFTRFD6IXJT32BGW33LWZYJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FO4OFTRFD6IXJT32BGW33LWZYJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:FO4OFTRFD6IXJT32BGW33LWZYJ","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":"b57c791764e152506a573520241f6d02db94592094bb91c279064bec41312c61","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2013-12-17T07:47:14Z","title_canon_sha256":"dac64ef2ea5e60433f1aac3ca415e2ee8d3d6c4495480fdc8967a10d8ec8b7b9"},"schema_version":"1.0","source":{"id":"1312.4676","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.4676","created_at":"2026-05-18T03:04:23Z"},{"alias_kind":"arxiv_version","alias_value":"1312.4676v1","created_at":"2026-05-18T03:04:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.4676","created_at":"2026-05-18T03:04:23Z"},{"alias_kind":"pith_short_12","alias_value":"FO4OFTRFD6IX","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"FO4OFTRFD6IXJT32","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"FO4OFTRF","created_at":"2026-05-18T12:27:45Z"}],"graph_snapshots":[{"event_id":"sha256:397403e31247cc7f8d8e6a8614e0693101c1701133eae93dca3cb05ff238668d","target":"graph","created_at":"2026-05-18T03:04:23Z","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":"Many complex systems are modeled through complex networks whose analysis reveals typical topological properties. Amongst those, the community structure is one of the most studied. Many methods are proposed to detect communities, not only in plain, but also in attributed, directed or even dynamic networks. A community structure takes the form of a partition of the node set, which must then be characterized relatively to the properties of the studied system. We propose a method to support such a characterization task. We define a sequence-based representation of networks, combining temporal info","authors_text":"G\\\"unce Keziban Orman, Jean-Fran\\c{c}ois Boulicaut (LIRIS), Marc Plantevit (LIRIS), Vincent Labatut","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2013-12-17T07:47:14Z","title":"Une m\\'ethode pour caract\\'eriser les communaut\\'es des r\\'eseaux dynamiques \\`a attributs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.4676","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:13713250d115bc8bcbb42dc052b4c1f31d91e64f6dada0645d3e95c907f52b9c","target":"record","created_at":"2026-05-18T03:04:23Z","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":"b57c791764e152506a573520241f6d02db94592094bb91c279064bec41312c61","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2013-12-17T07:47:14Z","title_canon_sha256":"dac64ef2ea5e60433f1aac3ca415e2ee8d3d6c4495480fdc8967a10d8ec8b7b9"},"schema_version":"1.0","source":{"id":"1312.4676","kind":"arxiv","version":1}},"canonical_sha256":"2bb8e2ce251f9174cf7a09adbdaed9c24ac4cea6dc2604699c167ab6ec1383fe","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2bb8e2ce251f9174cf7a09adbdaed9c24ac4cea6dc2604699c167ab6ec1383fe","first_computed_at":"2026-05-18T03:04:23.373134Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:04:23.373134Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yd2KnuKHURt8jFhWyJtWkzHbpGvzcfaQMehvCatf7qk5nQAduGMu1+H57m6YwKVvB9nz2nNKKvVkI8Q1xn3FDw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:04:23.373530Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.4676","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:13713250d115bc8bcbb42dc052b4c1f31d91e64f6dada0645d3e95c907f52b9c","sha256:397403e31247cc7f8d8e6a8614e0693101c1701133eae93dca3cb05ff238668d"],"state_sha256":"7f01a6db6de28422e73ad81fdc1cc872adf0e5dc7bdf7b6c563172ccca6930de"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nGLuaTfHDCXbSJI80iT9t8gWKx/IzA515vQwx4pzCkKLSVdET6hy+mHKiMdZnHfEWO9A4OsYBZt7rupua45eAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T20:48:19.982360Z","bundle_sha256":"4a4c2ac7bdb8d851c6a1a7fda4ba0dc16dc0d80f4d2aa5ac8180c65e82e9c448"}}