{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:ZTAIYCQM5SUGA2UEXEVTJJSAHF","short_pith_number":"pith:ZTAIYCQM","canonical_record":{"source":{"id":"1807.03971","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-11T07:30:24Z","cross_cats_sorted":[],"title_canon_sha256":"094c644a6ceb0069dc55d5f23ff0f0a9770695030b3f6064e1b3c429094754d4","abstract_canon_sha256":"b834d3332d290c75960eb4777344075b5f984c1d08e8099579494171069150a3"},"schema_version":"1.0"},"canonical_sha256":"ccc08c0a0ceca8606a84b92b34a6403957d54202f02e3f6a2159de2e4d61981b","source":{"kind":"arxiv","id":"1807.03971","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.03971","created_at":"2026-05-18T00:10:58Z"},{"alias_kind":"arxiv_version","alias_value":"1807.03971v1","created_at":"2026-05-18T00:10:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.03971","created_at":"2026-05-18T00:10:58Z"},{"alias_kind":"pith_short_12","alias_value":"ZTAIYCQM5SUG","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"ZTAIYCQM5SUGA2UE","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"ZTAIYCQM","created_at":"2026-05-18T12:33:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:ZTAIYCQM5SUGA2UEXEVTJJSAHF","target":"record","payload":{"canonical_record":{"source":{"id":"1807.03971","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-11T07:30:24Z","cross_cats_sorted":[],"title_canon_sha256":"094c644a6ceb0069dc55d5f23ff0f0a9770695030b3f6064e1b3c429094754d4","abstract_canon_sha256":"b834d3332d290c75960eb4777344075b5f984c1d08e8099579494171069150a3"},"schema_version":"1.0"},"canonical_sha256":"ccc08c0a0ceca8606a84b92b34a6403957d54202f02e3f6a2159de2e4d61981b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:58.448336Z","signature_b64":"FUtMmBSyEp4BPA6nlqCvFddHvURBRnik6IdSnW8+ZT/4H+rrE9CBvcAhfCQdLif5DSeIEeKSOJsUtgcfsAiQAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ccc08c0a0ceca8606a84b92b34a6403957d54202f02e3f6a2159de2e4d61981b","last_reissued_at":"2026-05-18T00:10:58.447606Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:58.447606Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.03971","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-18T00:10:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jcdCKH0BWSPEf1Ldt5g9abLixg1TKi/7JjjTJHyZMbpSWidZTq6rvWKZ2OYD4gVYDNfUO7S27GrAwS9cnUwcDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T18:33:29.993756Z"},"content_sha256":"41489cbda2a0be302a83280d6da1da6d100c452c834cf404337c1eeb987a208e","schema_version":"1.0","event_id":"sha256:41489cbda2a0be302a83280d6da1da6d100c452c834cf404337c1eeb987a208e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:ZTAIYCQM5SUGA2UEXEVTJJSAHF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Graph Operations and Neighborhood Polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Maryam Alipour, Peter Tittmann","submitted_at":"2018-07-11T07:30:24Z","abstract_excerpt":"The neighborhood polynomial of graph $G$ is the generating function for the number of vertex subsets of $G$ of which the vertices have a common neighbor in $G$. In this paper, we investigate the behavior of this polynomial under several graph operations. Specifically, we provide an explicit formula for the neighborhood polynomial of the graph obtained from a given graph $G$ by vertex attachment. We use this result to propose a recursive algorithm for the calculation of the neighborhood polynomial. Finally, we prove that the neighborhood polynomial can be found in polynomial-time in the class o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.03971","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-18T00:10:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KRAkQQjIAvphszKvohrvswR7h5Jb4gmXLik0XKwmbcEzXjZVtiJMBC/bmNFcF9SNnSKzgI2g4MahdUHpYtGcBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T18:33:29.994477Z"},"content_sha256":"0207107fea269fcfa8db86f146dae1d93637910466d384efd5cef3d43b5bbf8c","schema_version":"1.0","event_id":"sha256:0207107fea269fcfa8db86f146dae1d93637910466d384efd5cef3d43b5bbf8c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZTAIYCQM5SUGA2UEXEVTJJSAHF/bundle.json","state_url":"https://pith.science/pith/ZTAIYCQM5SUGA2UEXEVTJJSAHF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZTAIYCQM5SUGA2UEXEVTJJSAHF/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-07T18:33:29Z","links":{"resolver":"https://pith.science/pith/ZTAIYCQM5SUGA2UEXEVTJJSAHF","bundle":"https://pith.science/pith/ZTAIYCQM5SUGA2UEXEVTJJSAHF/bundle.json","state":"https://pith.science/pith/ZTAIYCQM5SUGA2UEXEVTJJSAHF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZTAIYCQM5SUGA2UEXEVTJJSAHF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:ZTAIYCQM5SUGA2UEXEVTJJSAHF","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":"b834d3332d290c75960eb4777344075b5f984c1d08e8099579494171069150a3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-11T07:30:24Z","title_canon_sha256":"094c644a6ceb0069dc55d5f23ff0f0a9770695030b3f6064e1b3c429094754d4"},"schema_version":"1.0","source":{"id":"1807.03971","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.03971","created_at":"2026-05-18T00:10:58Z"},{"alias_kind":"arxiv_version","alias_value":"1807.03971v1","created_at":"2026-05-18T00:10:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.03971","created_at":"2026-05-18T00:10:58Z"},{"alias_kind":"pith_short_12","alias_value":"ZTAIYCQM5SUG","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"ZTAIYCQM5SUGA2UE","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"ZTAIYCQM","created_at":"2026-05-18T12:33:07Z"}],"graph_snapshots":[{"event_id":"sha256:0207107fea269fcfa8db86f146dae1d93637910466d384efd5cef3d43b5bbf8c","target":"graph","created_at":"2026-05-18T00:10:58Z","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":"The neighborhood polynomial of graph $G$ is the generating function for the number of vertex subsets of $G$ of which the vertices have a common neighbor in $G$. In this paper, we investigate the behavior of this polynomial under several graph operations. Specifically, we provide an explicit formula for the neighborhood polynomial of the graph obtained from a given graph $G$ by vertex attachment. We use this result to propose a recursive algorithm for the calculation of the neighborhood polynomial. Finally, we prove that the neighborhood polynomial can be found in polynomial-time in the class o","authors_text":"Maryam Alipour, Peter Tittmann","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-11T07:30:24Z","title":"Graph Operations and Neighborhood Polynomials"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.03971","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:41489cbda2a0be302a83280d6da1da6d100c452c834cf404337c1eeb987a208e","target":"record","created_at":"2026-05-18T00:10:58Z","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":"b834d3332d290c75960eb4777344075b5f984c1d08e8099579494171069150a3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-11T07:30:24Z","title_canon_sha256":"094c644a6ceb0069dc55d5f23ff0f0a9770695030b3f6064e1b3c429094754d4"},"schema_version":"1.0","source":{"id":"1807.03971","kind":"arxiv","version":1}},"canonical_sha256":"ccc08c0a0ceca8606a84b92b34a6403957d54202f02e3f6a2159de2e4d61981b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ccc08c0a0ceca8606a84b92b34a6403957d54202f02e3f6a2159de2e4d61981b","first_computed_at":"2026-05-18T00:10:58.447606Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:10:58.447606Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FUtMmBSyEp4BPA6nlqCvFddHvURBRnik6IdSnW8+ZT/4H+rrE9CBvcAhfCQdLif5DSeIEeKSOJsUtgcfsAiQAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:10:58.448336Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.03971","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:41489cbda2a0be302a83280d6da1da6d100c452c834cf404337c1eeb987a208e","sha256:0207107fea269fcfa8db86f146dae1d93637910466d384efd5cef3d43b5bbf8c"],"state_sha256":"a459ddfda795d92510772e6e8975edd0915e3f25e4b498553e5963ff65824863"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a+DDNywgS2QmPtQ+PhtrBzclRLboLv4OmrO4dfWeQEVI19bRU+ZvgzMyBw4eE4INjC1Ja5XpIEiTtAKmGIT+Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T18:33:29.998289Z","bundle_sha256":"beeee2a9da8d220275f6630c2c1b12de5aae8ed8f00af7dbb069505c121133f8"}}