{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:3PF7MM634LBGBPJJOJ2LZFINA4","short_pith_number":"pith:3PF7MM63","canonical_record":{"source":{"id":"2006.10003","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2020-06-17T17:08:57Z","cross_cats_sorted":[],"title_canon_sha256":"6fa05d4f63d7e9c25fb9cf5fcbab40f909a83b9d69486cc7e616642a39a57670","abstract_canon_sha256":"fe3261c40d47ac2cb0b2d0e1f9ad3e175069e533b5affb6a3e8c47c6732e349b"},"schema_version":"1.0"},"canonical_sha256":"dbcbf633dbe2c260bd297274bc950d073c619b2fbf1a071e4168839364b44aa2","source":{"kind":"arxiv","id":"2006.10003","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2006.10003","created_at":"2026-07-05T01:11:07Z"},{"alias_kind":"arxiv_version","alias_value":"2006.10003v1","created_at":"2026-07-05T01:11:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.10003","created_at":"2026-07-05T01:11:07Z"},{"alias_kind":"pith_short_12","alias_value":"3PF7MM634LBG","created_at":"2026-07-05T01:11:07Z"},{"alias_kind":"pith_short_16","alias_value":"3PF7MM634LBGBPJJ","created_at":"2026-07-05T01:11:07Z"},{"alias_kind":"pith_short_8","alias_value":"3PF7MM63","created_at":"2026-07-05T01:11:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:3PF7MM634LBGBPJJOJ2LZFINA4","target":"record","payload":{"canonical_record":{"source":{"id":"2006.10003","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2020-06-17T17:08:57Z","cross_cats_sorted":[],"title_canon_sha256":"6fa05d4f63d7e9c25fb9cf5fcbab40f909a83b9d69486cc7e616642a39a57670","abstract_canon_sha256":"fe3261c40d47ac2cb0b2d0e1f9ad3e175069e533b5affb6a3e8c47c6732e349b"},"schema_version":"1.0"},"canonical_sha256":"dbcbf633dbe2c260bd297274bc950d073c619b2fbf1a071e4168839364b44aa2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:11:07.303483Z","signature_b64":"gMbSftiAlUEOHhaJIEJw6h5HqSX7TxUw/XuRrFDwjzXd358ni6iuHQgt/pdjjcXOgDHNQgRyLVPLjl40FZv/Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dbcbf633dbe2c260bd297274bc950d073c619b2fbf1a071e4168839364b44aa2","last_reissued_at":"2026-07-05T01:11:07.302967Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:11:07.302967Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2006.10003","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-07-05T01:11:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NPFYPevL/1mcHXDW2FdecYRj0iSIEUoNzeqJxFFo5NLEtFY7LQ2rvn1QFOAWIwRPPjaIBJmwETkScKwODqSVCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T07:14:49.660239Z"},"content_sha256":"5eb622a20233b995c122c3d1573bd3acd2abc3ef02dd4b16d96ef74d51a58ec8","schema_version":"1.0","event_id":"sha256:5eb622a20233b995c122c3d1573bd3acd2abc3ef02dd4b16d96ef74d51a58ec8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:3PF7MM634LBGBPJJOJ2LZFINA4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Scaling Choice Models of Relational Social Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"George Pakapol Supaniratisai, Jan Overgoor, Johan Ugander","submitted_at":"2020-06-17T17:08:57Z","abstract_excerpt":"Many prediction problems on social networks, from recommendations to anomaly detection, can be approached by modeling network data as a sequence of relational events and then leveraging the resulting model for prediction. Conditional logit models of discrete choice are a natural approach to modeling relational events as \"choices\" in a framework that envelops and extends many long-studied models of network formation. The conditional logit model is simplistic, but it is particularly attractive because it allows for efficient consistent likelihood maximization via negative sampling, something tha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.10003","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2006.10003/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T01:11:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q5Yd6Ox/a0XTN6amMWYWoQbLrpnYdbUwAIQc+qpz82kYR2ONE6XksxDqTpiozjKaBy00Qygz1qgMdR7LQs6BDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T07:14:49.660622Z"},"content_sha256":"d5908e646f4042ccd1ca7165f7d18076b6455b9477b21cce21dbbf2d263bc07a","schema_version":"1.0","event_id":"sha256:d5908e646f4042ccd1ca7165f7d18076b6455b9477b21cce21dbbf2d263bc07a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3PF7MM634LBGBPJJOJ2LZFINA4/bundle.json","state_url":"https://pith.science/pith/3PF7MM634LBGBPJJOJ2LZFINA4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3PF7MM634LBGBPJJOJ2LZFINA4/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-08-04T07:14:49Z","links":{"resolver":"https://pith.science/pith/3PF7MM634LBGBPJJOJ2LZFINA4","bundle":"https://pith.science/pith/3PF7MM634LBGBPJJOJ2LZFINA4/bundle.json","state":"https://pith.science/pith/3PF7MM634LBGBPJJOJ2LZFINA4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3PF7MM634LBGBPJJOJ2LZFINA4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:3PF7MM634LBGBPJJOJ2LZFINA4","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":"fe3261c40d47ac2cb0b2d0e1f9ad3e175069e533b5affb6a3e8c47c6732e349b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2020-06-17T17:08:57Z","title_canon_sha256":"6fa05d4f63d7e9c25fb9cf5fcbab40f909a83b9d69486cc7e616642a39a57670"},"schema_version":"1.0","source":{"id":"2006.10003","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2006.10003","created_at":"2026-07-05T01:11:07Z"},{"alias_kind":"arxiv_version","alias_value":"2006.10003v1","created_at":"2026-07-05T01:11:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.10003","created_at":"2026-07-05T01:11:07Z"},{"alias_kind":"pith_short_12","alias_value":"3PF7MM634LBG","created_at":"2026-07-05T01:11:07Z"},{"alias_kind":"pith_short_16","alias_value":"3PF7MM634LBGBPJJ","created_at":"2026-07-05T01:11:07Z"},{"alias_kind":"pith_short_8","alias_value":"3PF7MM63","created_at":"2026-07-05T01:11:07Z"}],"graph_snapshots":[{"event_id":"sha256:d5908e646f4042ccd1ca7165f7d18076b6455b9477b21cce21dbbf2d263bc07a","target":"graph","created_at":"2026-07-05T01:11:07Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2006.10003/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Many prediction problems on social networks, from recommendations to anomaly detection, can be approached by modeling network data as a sequence of relational events and then leveraging the resulting model for prediction. Conditional logit models of discrete choice are a natural approach to modeling relational events as \"choices\" in a framework that envelops and extends many long-studied models of network formation. The conditional logit model is simplistic, but it is particularly attractive because it allows for efficient consistent likelihood maximization via negative sampling, something tha","authors_text":"George Pakapol Supaniratisai, Jan Overgoor, Johan Ugander","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2020-06-17T17:08:57Z","title":"Scaling Choice Models of Relational Social Data"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.10003","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:5eb622a20233b995c122c3d1573bd3acd2abc3ef02dd4b16d96ef74d51a58ec8","target":"record","created_at":"2026-07-05T01:11:07Z","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":"fe3261c40d47ac2cb0b2d0e1f9ad3e175069e533b5affb6a3e8c47c6732e349b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2020-06-17T17:08:57Z","title_canon_sha256":"6fa05d4f63d7e9c25fb9cf5fcbab40f909a83b9d69486cc7e616642a39a57670"},"schema_version":"1.0","source":{"id":"2006.10003","kind":"arxiv","version":1}},"canonical_sha256":"dbcbf633dbe2c260bd297274bc950d073c619b2fbf1a071e4168839364b44aa2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dbcbf633dbe2c260bd297274bc950d073c619b2fbf1a071e4168839364b44aa2","first_computed_at":"2026-07-05T01:11:07.302967Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:11:07.302967Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gMbSftiAlUEOHhaJIEJw6h5HqSX7TxUw/XuRrFDwjzXd358ni6iuHQgt/pdjjcXOgDHNQgRyLVPLjl40FZv/Cw==","signature_status":"signed_v1","signed_at":"2026-07-05T01:11:07.303483Z","signed_message":"canonical_sha256_bytes"},"source_id":"2006.10003","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5eb622a20233b995c122c3d1573bd3acd2abc3ef02dd4b16d96ef74d51a58ec8","sha256:d5908e646f4042ccd1ca7165f7d18076b6455b9477b21cce21dbbf2d263bc07a"],"state_sha256":"e8354e7dc4a4dcef86123b3abb82ad18dc2e8768fc9b722057bd727a250e1ea3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O9O3rhxfw4+AZ5sqaLb7C7qaEQmEB/4OnoQ/w3Ul2bRP4/OyXOys96ZYIT1AJP3zcshie3Tt1zJK2nRqHlJZAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T07:14:49.663116Z","bundle_sha256":"1b013742741b7dd4212c3e455908722c88fbdfedc220f898b6330193e41d05ed"}}