{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:FI4JSUGLHOGCOR6SDEUSKKR2EO","short_pith_number":"pith:FI4JSUGL","canonical_record":{"source":{"id":"1502.04690","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-02-16T20:43:49Z","cross_cats_sorted":[],"title_canon_sha256":"1507a02562cd88653f2c3c8003174320a62b1dbc1bec5a634c61d4be0a047483","abstract_canon_sha256":"d8e220f8ee379955cdb8eeda3da12e716e9968400bf75b0fee904ebb224d73d8"},"schema_version":"1.0"},"canonical_sha256":"2a389950cb3b8c2747d21929252a3a23908bc4e6df143e862f7e14f66b5596b7","source":{"kind":"arxiv","id":"1502.04690","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.04690","created_at":"2026-05-18T01:33:24Z"},{"alias_kind":"arxiv_version","alias_value":"1502.04690v3","created_at":"2026-05-18T01:33:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.04690","created_at":"2026-05-18T01:33:24Z"},{"alias_kind":"pith_short_12","alias_value":"FI4JSUGLHOGC","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"FI4JSUGLHOGCOR6S","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"FI4JSUGL","created_at":"2026-05-18T12:29:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:FI4JSUGLHOGCOR6SDEUSKKR2EO","target":"record","payload":{"canonical_record":{"source":{"id":"1502.04690","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-02-16T20:43:49Z","cross_cats_sorted":[],"title_canon_sha256":"1507a02562cd88653f2c3c8003174320a62b1dbc1bec5a634c61d4be0a047483","abstract_canon_sha256":"d8e220f8ee379955cdb8eeda3da12e716e9968400bf75b0fee904ebb224d73d8"},"schema_version":"1.0"},"canonical_sha256":"2a389950cb3b8c2747d21929252a3a23908bc4e6df143e862f7e14f66b5596b7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:33:24.168265Z","signature_b64":"3fexIf75RgjRl6GwOpn72a9ElogLcNfJhgElxXVsp+diwrjxhQEMWltVRTc4Yf2KMsb55SE144TpZhi0t+MxBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2a389950cb3b8c2747d21929252a3a23908bc4e6df143e862f7e14f66b5596b7","last_reissued_at":"2026-05-18T01:33:24.167669Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:33:24.167669Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1502.04690","source_version":3,"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:33:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"94CGVQKJMBmeyXkFIlg9NfSr+HvZeT7VupFbQYpqD2ndmR0wnYksj2UiOCZdI11P83aYLfE4UA0VZrhOCxZtAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T17:39:02.836446Z"},"content_sha256":"8ed8ba878d13cbad8c6c2d8bd75791a13e17e3c18a186fa61b25155834b3bed5","schema_version":"1.0","event_id":"sha256:8ed8ba878d13cbad8c6c2d8bd75791a13e17e3c18a186fa61b25155834b3bed5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:FI4JSUGLHOGCOR6SDEUSKKR2EO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"CoEulerian graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Lionel Levine, Matthew Farrell","submitted_at":"2015-02-16T20:43:49Z","abstract_excerpt":"We suggest a measure of \"Eulerianness\" of a finite directed graph and define a class of \"coEulerian\" graphs. These are the graphs whose Laplacian lattice is as large as possible. As an application, we address a question in chip-firing posed by Bjorner, Lovasz, and Shor in 1991, who asked for \"a characterization of those digraphs and initial chip configurations that guarantee finite termination.\" Bjorner and Lovasz gave an exponential time algorithm in 1992. We show that this can be improved to linear time if the graph is coEulerian, and that the problem is NP-complete for general directed mult"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.04690","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"},"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:33:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HGbguRJZhCM+2XdXO/ucM7smiabCFI301xsErny0T/0jj3vE5grMQdyGEBeVz18TNCzpnatu4hu1/SdFL7viCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T17:39:02.837020Z"},"content_sha256":"15ddf0d5b47bc77aa0503e217212740c0d0fdc41640a2e97d45e106000ff134d","schema_version":"1.0","event_id":"sha256:15ddf0d5b47bc77aa0503e217212740c0d0fdc41640a2e97d45e106000ff134d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FI4JSUGLHOGCOR6SDEUSKKR2EO/bundle.json","state_url":"https://pith.science/pith/FI4JSUGLHOGCOR6SDEUSKKR2EO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FI4JSUGLHOGCOR6SDEUSKKR2EO/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-23T17:39:02Z","links":{"resolver":"https://pith.science/pith/FI4JSUGLHOGCOR6SDEUSKKR2EO","bundle":"https://pith.science/pith/FI4JSUGLHOGCOR6SDEUSKKR2EO/bundle.json","state":"https://pith.science/pith/FI4JSUGLHOGCOR6SDEUSKKR2EO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FI4JSUGLHOGCOR6SDEUSKKR2EO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:FI4JSUGLHOGCOR6SDEUSKKR2EO","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":"d8e220f8ee379955cdb8eeda3da12e716e9968400bf75b0fee904ebb224d73d8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-02-16T20:43:49Z","title_canon_sha256":"1507a02562cd88653f2c3c8003174320a62b1dbc1bec5a634c61d4be0a047483"},"schema_version":"1.0","source":{"id":"1502.04690","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.04690","created_at":"2026-05-18T01:33:24Z"},{"alias_kind":"arxiv_version","alias_value":"1502.04690v3","created_at":"2026-05-18T01:33:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.04690","created_at":"2026-05-18T01:33:24Z"},{"alias_kind":"pith_short_12","alias_value":"FI4JSUGLHOGC","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"FI4JSUGLHOGCOR6S","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"FI4JSUGL","created_at":"2026-05-18T12:29:19Z"}],"graph_snapshots":[{"event_id":"sha256:15ddf0d5b47bc77aa0503e217212740c0d0fdc41640a2e97d45e106000ff134d","target":"graph","created_at":"2026-05-18T01:33:24Z","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 suggest a measure of \"Eulerianness\" of a finite directed graph and define a class of \"coEulerian\" graphs. These are the graphs whose Laplacian lattice is as large as possible. As an application, we address a question in chip-firing posed by Bjorner, Lovasz, and Shor in 1991, who asked for \"a characterization of those digraphs and initial chip configurations that guarantee finite termination.\" Bjorner and Lovasz gave an exponential time algorithm in 1992. We show that this can be improved to linear time if the graph is coEulerian, and that the problem is NP-complete for general directed mult","authors_text":"Lionel Levine, Matthew Farrell","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-02-16T20:43:49Z","title":"CoEulerian graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.04690","kind":"arxiv","version":3},"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:8ed8ba878d13cbad8c6c2d8bd75791a13e17e3c18a186fa61b25155834b3bed5","target":"record","created_at":"2026-05-18T01:33:24Z","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":"d8e220f8ee379955cdb8eeda3da12e716e9968400bf75b0fee904ebb224d73d8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-02-16T20:43:49Z","title_canon_sha256":"1507a02562cd88653f2c3c8003174320a62b1dbc1bec5a634c61d4be0a047483"},"schema_version":"1.0","source":{"id":"1502.04690","kind":"arxiv","version":3}},"canonical_sha256":"2a389950cb3b8c2747d21929252a3a23908bc4e6df143e862f7e14f66b5596b7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2a389950cb3b8c2747d21929252a3a23908bc4e6df143e862f7e14f66b5596b7","first_computed_at":"2026-05-18T01:33:24.167669Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:33:24.167669Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3fexIf75RgjRl6GwOpn72a9ElogLcNfJhgElxXVsp+diwrjxhQEMWltVRTc4Yf2KMsb55SE144TpZhi0t+MxBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:33:24.168265Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.04690","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8ed8ba878d13cbad8c6c2d8bd75791a13e17e3c18a186fa61b25155834b3bed5","sha256:15ddf0d5b47bc77aa0503e217212740c0d0fdc41640a2e97d45e106000ff134d"],"state_sha256":"0ba04ab289ee14f574ff9419517a23cf5cf56e9a2fe63da366ac2d19cc530f5d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3gxAMOE33m6nAQT9P0DYcYj1dmwE1lN5JIyl+Sbhq33Cl1f1nzg6ZTY9LLWcxcpAD/c3RHA+sgC/Vb/Y5obOAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T17:39:02.839459Z","bundle_sha256":"8aaa99f13fa7b5407218454ead5a0f5a8bbe9779ef0a04c22ec45b00792c58a5"}}