{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:QXEZSC6LZ74T54Y7SJ2S6FS6W7","short_pith_number":"pith:QXEZSC6L","canonical_record":{"source":{"id":"1405.2466","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-05-10T19:58:20Z","cross_cats_sorted":["math-ph","math.CO","math.MP"],"title_canon_sha256":"c2e4196a3d3ead0d291be002d7de8993ff36320c6ae95d248455d4242cc44b0d","abstract_canon_sha256":"0e0adf691e4b401cf2e3527c909d1156cff33650f53e93a88aef82972a26b10f"},"schema_version":"1.0"},"canonical_sha256":"85c9990bcbcff93ef31f92752f165eb7fb1047a387b4f8f2e3cfdc0cb0011510","source":{"kind":"arxiv","id":"1405.2466","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.2466","created_at":"2026-05-18T01:34:59Z"},{"alias_kind":"arxiv_version","alias_value":"1405.2466v4","created_at":"2026-05-18T01:34:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.2466","created_at":"2026-05-18T01:34:59Z"},{"alias_kind":"pith_short_12","alias_value":"QXEZSC6LZ74T","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"QXEZSC6LZ74T54Y7","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"QXEZSC6L","created_at":"2026-05-18T12:28:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:QXEZSC6LZ74T54Y7SJ2S6FS6W7","target":"record","payload":{"canonical_record":{"source":{"id":"1405.2466","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-05-10T19:58:20Z","cross_cats_sorted":["math-ph","math.CO","math.MP"],"title_canon_sha256":"c2e4196a3d3ead0d291be002d7de8993ff36320c6ae95d248455d4242cc44b0d","abstract_canon_sha256":"0e0adf691e4b401cf2e3527c909d1156cff33650f53e93a88aef82972a26b10f"},"schema_version":"1.0"},"canonical_sha256":"85c9990bcbcff93ef31f92752f165eb7fb1047a387b4f8f2e3cfdc0cb0011510","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:34:59.301820Z","signature_b64":"zFmqFos+DCWPjkQV4MocWjfFay/dQ1EoZDhMFTbO2BB+Ei0fKSVh/ncMGsTg14i48IY7QL8D8K5izYXD1J7SBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"85c9990bcbcff93ef31f92752f165eb7fb1047a387b4f8f2e3cfdc0cb0011510","last_reissued_at":"2026-05-18T01:34:59.301190Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:34:59.301190Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1405.2466","source_version":4,"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-18T01:34:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4PYb93JXEsUlY4ZnaMiAWyK3PlqpfphaEmIQ/Lks5n4m21Zg8GJSauVLIW402kxwfvrwoDrBaRQBkGpDI9D/AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T15:04:49.382274Z"},"content_sha256":"6bced470e3e9b76e35a402783b342f88cc64543c7fa48e5cb712a30f06b7558e","schema_version":"1.0","event_id":"sha256:6bced470e3e9b76e35a402783b342f88cc64543c7fa48e5cb712a30f06b7558e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:QXEZSC6LZ74T54Y7SJ2S6FS6W7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Asymptotic structure and singularities in constrained directed graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math-ph","math.CO","math.MP"],"primary_cat":"math.PR","authors_text":"David Aristoff, Lingjiong Zhu","submitted_at":"2014-05-10T19:58:20Z","abstract_excerpt":"We study the asymptotics of large directed graphs, constrained to have certain densities of edges and/or outward $p$-stars. Our models are close cousins of exponential random graph models (ERGMs), in which edges and certain other subgraph densities are controlled by parameters. The idea of directly constraining edge and other subgraph densities comes from Radin and Sadun. Such modeling circumvents a phenomenon first made precise by Chatterjee and Diaconis: that in ERGMs it is often impossible to independently constrain edge and other subgraph densities. In all our models, we find that large gr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.2466","kind":"arxiv","version":4},"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-18T01:34:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"216kZu93OsM4nhgz7YGOAqrCPf+VNtJVfonlbFlBfGYhrdiRK+dqKUsPILYQMNpcxv8NgIU5KR92SbncuexBCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T15:04:49.382930Z"},"content_sha256":"29b45ed3f92a35a1a38db94ac56ac6c7b79513dff59b4e6e2260e8e050d0e107","schema_version":"1.0","event_id":"sha256:29b45ed3f92a35a1a38db94ac56ac6c7b79513dff59b4e6e2260e8e050d0e107"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QXEZSC6LZ74T54Y7SJ2S6FS6W7/bundle.json","state_url":"https://pith.science/pith/QXEZSC6LZ74T54Y7SJ2S6FS6W7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QXEZSC6LZ74T54Y7SJ2S6FS6W7/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-25T15:04:49Z","links":{"resolver":"https://pith.science/pith/QXEZSC6LZ74T54Y7SJ2S6FS6W7","bundle":"https://pith.science/pith/QXEZSC6LZ74T54Y7SJ2S6FS6W7/bundle.json","state":"https://pith.science/pith/QXEZSC6LZ74T54Y7SJ2S6FS6W7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QXEZSC6LZ74T54Y7SJ2S6FS6W7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:QXEZSC6LZ74T54Y7SJ2S6FS6W7","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":"0e0adf691e4b401cf2e3527c909d1156cff33650f53e93a88aef82972a26b10f","cross_cats_sorted":["math-ph","math.CO","math.MP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-05-10T19:58:20Z","title_canon_sha256":"c2e4196a3d3ead0d291be002d7de8993ff36320c6ae95d248455d4242cc44b0d"},"schema_version":"1.0","source":{"id":"1405.2466","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.2466","created_at":"2026-05-18T01:34:59Z"},{"alias_kind":"arxiv_version","alias_value":"1405.2466v4","created_at":"2026-05-18T01:34:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.2466","created_at":"2026-05-18T01:34:59Z"},{"alias_kind":"pith_short_12","alias_value":"QXEZSC6LZ74T","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"QXEZSC6LZ74T54Y7","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"QXEZSC6L","created_at":"2026-05-18T12:28:46Z"}],"graph_snapshots":[{"event_id":"sha256:29b45ed3f92a35a1a38db94ac56ac6c7b79513dff59b4e6e2260e8e050d0e107","target":"graph","created_at":"2026-05-18T01:34: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":"We study the asymptotics of large directed graphs, constrained to have certain densities of edges and/or outward $p$-stars. Our models are close cousins of exponential random graph models (ERGMs), in which edges and certain other subgraph densities are controlled by parameters. The idea of directly constraining edge and other subgraph densities comes from Radin and Sadun. Such modeling circumvents a phenomenon first made precise by Chatterjee and Diaconis: that in ERGMs it is often impossible to independently constrain edge and other subgraph densities. In all our models, we find that large gr","authors_text":"David Aristoff, Lingjiong Zhu","cross_cats":["math-ph","math.CO","math.MP"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-05-10T19:58:20Z","title":"Asymptotic structure and singularities in constrained directed graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.2466","kind":"arxiv","version":4},"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:6bced470e3e9b76e35a402783b342f88cc64543c7fa48e5cb712a30f06b7558e","target":"record","created_at":"2026-05-18T01:34: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":"0e0adf691e4b401cf2e3527c909d1156cff33650f53e93a88aef82972a26b10f","cross_cats_sorted":["math-ph","math.CO","math.MP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-05-10T19:58:20Z","title_canon_sha256":"c2e4196a3d3ead0d291be002d7de8993ff36320c6ae95d248455d4242cc44b0d"},"schema_version":"1.0","source":{"id":"1405.2466","kind":"arxiv","version":4}},"canonical_sha256":"85c9990bcbcff93ef31f92752f165eb7fb1047a387b4f8f2e3cfdc0cb0011510","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"85c9990bcbcff93ef31f92752f165eb7fb1047a387b4f8f2e3cfdc0cb0011510","first_computed_at":"2026-05-18T01:34:59.301190Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:34:59.301190Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zFmqFos+DCWPjkQV4MocWjfFay/dQ1EoZDhMFTbO2BB+Ei0fKSVh/ncMGsTg14i48IY7QL8D8K5izYXD1J7SBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:34:59.301820Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.2466","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6bced470e3e9b76e35a402783b342f88cc64543c7fa48e5cb712a30f06b7558e","sha256:29b45ed3f92a35a1a38db94ac56ac6c7b79513dff59b4e6e2260e8e050d0e107"],"state_sha256":"317abe5798c4527310f2c3ac63534e2ecb55c5c41a92e03574c427c7911d3ca6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Hgq3G87XNeB8mHYAXEuhYNFDXAtQ5hJrs2uGrTvvG0MkkZJhdTue6WEWcrvgcE5A2vxdIKXg2IgVvTEdb75vCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T15:04:49.385940Z","bundle_sha256":"bd80813212d0094376e7ef97fefd03f8700df671ce59b87ef9f98b95e8777312"}}