{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:GAP7U3I4UB72FUIIC5EGZKF53C","short_pith_number":"pith:GAP7U3I4","canonical_record":{"source":{"id":"1710.05207","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-10-14T16:27:51Z","cross_cats_sorted":[],"title_canon_sha256":"8538dd3c7712ef76521538f79af591dc6ea6d39d55c44b5c91d6c2c611ead92d","abstract_canon_sha256":"cbc121f5617d3b33c806fb16c6df800c30df5ad7156521ff7baa85aeb686cc53"},"schema_version":"1.0"},"canonical_sha256":"301ffa6d1ca07fa2d10817486ca8bdd8a7a133918de340816ab99b0d1c94f527","source":{"kind":"arxiv","id":"1710.05207","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.05207","created_at":"2026-05-18T00:26:14Z"},{"alias_kind":"arxiv_version","alias_value":"1710.05207v2","created_at":"2026-05-18T00:26:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.05207","created_at":"2026-05-18T00:26:14Z"},{"alias_kind":"pith_short_12","alias_value":"GAP7U3I4UB72","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"GAP7U3I4UB72FUII","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"GAP7U3I4","created_at":"2026-05-18T12:31:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:GAP7U3I4UB72FUIIC5EGZKF53C","target":"record","payload":{"canonical_record":{"source":{"id":"1710.05207","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-10-14T16:27:51Z","cross_cats_sorted":[],"title_canon_sha256":"8538dd3c7712ef76521538f79af591dc6ea6d39d55c44b5c91d6c2c611ead92d","abstract_canon_sha256":"cbc121f5617d3b33c806fb16c6df800c30df5ad7156521ff7baa85aeb686cc53"},"schema_version":"1.0"},"canonical_sha256":"301ffa6d1ca07fa2d10817486ca8bdd8a7a133918de340816ab99b0d1c94f527","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:14.385251Z","signature_b64":"FrY1vKqiJ6uLbQT/ZmB/MSFmV/UaHjKpAO7mFTiKP/RErFAIOMIy4vnRv7YG0BMCbprvFONuQFlcIUY6ElB0CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"301ffa6d1ca07fa2d10817486ca8bdd8a7a133918de340816ab99b0d1c94f527","last_reissued_at":"2026-05-18T00:26:14.384710Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:14.384710Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.05207","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:26:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Boy3AjHXG5xGEF27GKlabZ2YoF5YjmNCR28ZNNYotiYo+0HFJJoiNBeOOgxrTsgoVer9FO3IEKfEb2Qjk69DCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T13:53:29.616768Z"},"content_sha256":"392597d6fa79dabb615a070fa831c29899b8984592b60f15629b399452edb98d","schema_version":"1.0","event_id":"sha256:392597d6fa79dabb615a070fa831c29899b8984592b60f15629b399452edb98d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:GAP7U3I4UB72FUIIC5EGZKF53C","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Network Model Selection Using Task-Focused Minimum Description Length","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Ivan Brugere, Tanya Y. Berger-Wolf","submitted_at":"2017-10-14T16:27:51Z","abstract_excerpt":"Networks are fundamental models for data used in practically every application domain. In most instances, several implicit or explicit choices about the network definition impact the translation of underlying data to a network representation, and the subsequent question(s) about the underlying system being represented. Users of downstream network data may not even be aware of these choices or their impacts. We propose a task-focused network model selection methodology which addresses several key challenges. Our approach constructs network models from underlying data and uses minimum descriptio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.05207","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:26:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Cq5uyNZZmhg8xu11Hwu7bYpKSH8cl7GUuhxuMTmKcVXgE0i8FFMH+XAzDoxomgj8iq3iLSDchcC3ik59ilh9DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T13:53:29.617131Z"},"content_sha256":"559344f6213f514d7edc58db42ff67fadfe428ff35ffa54292bee1a2c516cd71","schema_version":"1.0","event_id":"sha256:559344f6213f514d7edc58db42ff67fadfe428ff35ffa54292bee1a2c516cd71"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GAP7U3I4UB72FUIIC5EGZKF53C/bundle.json","state_url":"https://pith.science/pith/GAP7U3I4UB72FUIIC5EGZKF53C/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GAP7U3I4UB72FUIIC5EGZKF53C/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-05T13:53:29Z","links":{"resolver":"https://pith.science/pith/GAP7U3I4UB72FUIIC5EGZKF53C","bundle":"https://pith.science/pith/GAP7U3I4UB72FUIIC5EGZKF53C/bundle.json","state":"https://pith.science/pith/GAP7U3I4UB72FUIIC5EGZKF53C/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GAP7U3I4UB72FUIIC5EGZKF53C/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:GAP7U3I4UB72FUIIC5EGZKF53C","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":"cbc121f5617d3b33c806fb16c6df800c30df5ad7156521ff7baa85aeb686cc53","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-10-14T16:27:51Z","title_canon_sha256":"8538dd3c7712ef76521538f79af591dc6ea6d39d55c44b5c91d6c2c611ead92d"},"schema_version":"1.0","source":{"id":"1710.05207","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.05207","created_at":"2026-05-18T00:26:14Z"},{"alias_kind":"arxiv_version","alias_value":"1710.05207v2","created_at":"2026-05-18T00:26:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.05207","created_at":"2026-05-18T00:26:14Z"},{"alias_kind":"pith_short_12","alias_value":"GAP7U3I4UB72","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"GAP7U3I4UB72FUII","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"GAP7U3I4","created_at":"2026-05-18T12:31:15Z"}],"graph_snapshots":[{"event_id":"sha256:559344f6213f514d7edc58db42ff67fadfe428ff35ffa54292bee1a2c516cd71","target":"graph","created_at":"2026-05-18T00:26: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":"Networks are fundamental models for data used in practically every application domain. In most instances, several implicit or explicit choices about the network definition impact the translation of underlying data to a network representation, and the subsequent question(s) about the underlying system being represented. Users of downstream network data may not even be aware of these choices or their impacts. We propose a task-focused network model selection methodology which addresses several key challenges. Our approach constructs network models from underlying data and uses minimum descriptio","authors_text":"Ivan Brugere, Tanya Y. Berger-Wolf","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-10-14T16:27:51Z","title":"Network Model Selection Using Task-Focused Minimum Description Length"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.05207","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:392597d6fa79dabb615a070fa831c29899b8984592b60f15629b399452edb98d","target":"record","created_at":"2026-05-18T00:26: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":"cbc121f5617d3b33c806fb16c6df800c30df5ad7156521ff7baa85aeb686cc53","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-10-14T16:27:51Z","title_canon_sha256":"8538dd3c7712ef76521538f79af591dc6ea6d39d55c44b5c91d6c2c611ead92d"},"schema_version":"1.0","source":{"id":"1710.05207","kind":"arxiv","version":2}},"canonical_sha256":"301ffa6d1ca07fa2d10817486ca8bdd8a7a133918de340816ab99b0d1c94f527","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"301ffa6d1ca07fa2d10817486ca8bdd8a7a133918de340816ab99b0d1c94f527","first_computed_at":"2026-05-18T00:26:14.384710Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:26:14.384710Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FrY1vKqiJ6uLbQT/ZmB/MSFmV/UaHjKpAO7mFTiKP/RErFAIOMIy4vnRv7YG0BMCbprvFONuQFlcIUY6ElB0CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:26:14.385251Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.05207","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:392597d6fa79dabb615a070fa831c29899b8984592b60f15629b399452edb98d","sha256:559344f6213f514d7edc58db42ff67fadfe428ff35ffa54292bee1a2c516cd71"],"state_sha256":"1b7da8666bed7f6522dccec979ffd99c27cddae7318531dda107095a4f55f50d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dOvMAGnkdscVbzwpo2Vm8ViMfZ98/4Tn1kqHFRnEbcewRb9nWjqx+6DGQSqFurLoubFtyVlZ/N6Wl9wzWfS/BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T13:53:29.619129Z","bundle_sha256":"0e0c98b882d1fd5399f1229f1527a61e2b6997be2128163933bab5314c225f57"}}