{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:FFF4OKRSG7XZER2IKTCLLDIGXP","short_pith_number":"pith:FFF4OKRS","schema_version":"1.0","canonical_sha256":"294bc72a3237ef92474854c4b58d06bbc808f0dbce8f0b439d67d782594c39f4","source":{"kind":"arxiv","id":"1607.04102","version":3},"attestation_state":"computed","paper":{"title":"Asymmetry and structural information in preferential attachment graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Abram Magner, Tomasz Luczak, Wojciech Szpankowski","submitted_at":"2016-07-14T12:10:49Z","abstract_excerpt":"Graph symmetries intervene in diverse applications, from enumeration, to graph structure compression, to the discovery of graph dynamics (e.g., node arrival order inference). Whereas Erd\\H{o}s-R\\'enyi graphs are typically asymmetric, real networks are highly symmetric. So a natural question is whether preferential attachment graphs, where in each step a new node with $m$ edges is added, exhibit any symmetry. In recent work it was proved that preferential attachment graphs are symmetric for $m=1$, and there is some non-negligible probability of symmetry for $m=2$. It was conjectured that these "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1607.04102","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-07-14T12:10:49Z","cross_cats_sorted":[],"title_canon_sha256":"8e781c5c2b4a6729b0911526221a89bfea76179b688da1c73deb8033ea479e0f","abstract_canon_sha256":"1758f4440a819b79f831fa8e88fdf772903c62a770ef09bfab9f441e026139a9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:33.135153Z","signature_b64":"A+YEhQf5uhhKe9w3pKLLj69z9v94E11nUEoEav6ij4feZY39igBJtAz+T+raDGdHVpv9ez546sytaYWUD1DaAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"294bc72a3237ef92474854c4b58d06bbc808f0dbce8f0b439d67d782594c39f4","last_reissued_at":"2026-05-17T23:57:33.134596Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:33.134596Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Asymmetry and structural information in preferential attachment graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Abram Magner, Tomasz Luczak, Wojciech Szpankowski","submitted_at":"2016-07-14T12:10:49Z","abstract_excerpt":"Graph symmetries intervene in diverse applications, from enumeration, to graph structure compression, to the discovery of graph dynamics (e.g., node arrival order inference). Whereas Erd\\H{o}s-R\\'enyi graphs are typically asymmetric, real networks are highly symmetric. So a natural question is whether preferential attachment graphs, where in each step a new node with $m$ edges is added, exhibit any symmetry. In recent work it was proved that preferential attachment graphs are symmetric for $m=1$, and there is some non-negligible probability of symmetry for $m=2$. It was conjectured that these "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.04102","kind":"arxiv","version":3},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1607.04102","created_at":"2026-05-17T23:57:33.134675+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.04102v3","created_at":"2026-05-17T23:57:33.134675+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.04102","created_at":"2026-05-17T23:57:33.134675+00:00"},{"alias_kind":"pith_short_12","alias_value":"FFF4OKRSG7XZ","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_16","alias_value":"FFF4OKRSG7XZER2I","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_8","alias_value":"FFF4OKRS","created_at":"2026-05-18T12:30:15.759754+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FFF4OKRSG7XZER2IKTCLLDIGXP","json":"https://pith.science/pith/FFF4OKRSG7XZER2IKTCLLDIGXP.json","graph_json":"https://pith.science/api/pith-number/FFF4OKRSG7XZER2IKTCLLDIGXP/graph.json","events_json":"https://pith.science/api/pith-number/FFF4OKRSG7XZER2IKTCLLDIGXP/events.json","paper":"https://pith.science/paper/FFF4OKRS"},"agent_actions":{"view_html":"https://pith.science/pith/FFF4OKRSG7XZER2IKTCLLDIGXP","download_json":"https://pith.science/pith/FFF4OKRSG7XZER2IKTCLLDIGXP.json","view_paper":"https://pith.science/paper/FFF4OKRS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.04102&json=true","fetch_graph":"https://pith.science/api/pith-number/FFF4OKRSG7XZER2IKTCLLDIGXP/graph.json","fetch_events":"https://pith.science/api/pith-number/FFF4OKRSG7XZER2IKTCLLDIGXP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FFF4OKRSG7XZER2IKTCLLDIGXP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FFF4OKRSG7XZER2IKTCLLDIGXP/action/storage_attestation","attest_author":"https://pith.science/pith/FFF4OKRSG7XZER2IKTCLLDIGXP/action/author_attestation","sign_citation":"https://pith.science/pith/FFF4OKRSG7XZER2IKTCLLDIGXP/action/citation_signature","submit_replication":"https://pith.science/pith/FFF4OKRSG7XZER2IKTCLLDIGXP/action/replication_record"}},"created_at":"2026-05-17T23:57:33.134675+00:00","updated_at":"2026-05-17T23:57:33.134675+00:00"}